Graph bundles generalize the notion of covering graphs and graph products. In Imrich et al. (Discrete Math. 167/168 (1988) 393-403.) an algorithm that finds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base was given. In this paper we extend this algorithm to recognize Cartesian graph bundles over a K4\e-free simple base, without induced K3,3. Finally, we conjecture the existence of algorithm for recognition of Cartesian graph bundle over a K4\e-free simple base. © 2001 Elsevier Science B.V. All rights reserved.
Zmazek, B., & Žerovnik, J. (2001). On recognizing Cartesian graph bundles. Discrete Mathematics, 233(1–3), 381–391. https://doi.org/10.1016/S0012-365X(00)00254-5