On recognizing Cartesian graph bundles (Q5936045): Difference between revisions

Let \(B\) and \(F\) be graphs. A graph \(G\) is a Cartesian graph bundle with fibre \(F\) over the base graph \(B\) if there is a mapping \(p:G\to B\) which satisfies the following conditions: (1) \(p\) maps adjacent vertices of \(G\) to adjacent or identical vertices of \(B\). (2) \(p\) maps edges to edges or vertices. (3) For each \(v\in V(B)\), \(p^-(v)\cong F\), and for every \(e\in E(B)\), \(p^{-1}(e)\) is the Cartesian product of \(K_2\) and \(F\). The authors extend a polynomial algorithm for recognition of Cartesian graph bundles over \(K_3\)-free simple base to one for recognition of Cartesian graph bundles over a \(K_4\setminus e\) simple base, without induced \(K_{3,3}\).