Jordan circuits of a graph
Let \(G\) be a connected, finite graph. Let \(C\) be a circuit of \(G\). \(\beta(C)\), the strong bridge graph of \(C\) in \(G\), is defined as follows: (1) the vertices of \(\beta(C)\) are the bridges of \(C\) in \(G\), and (2) there is an edge in \(\beta(C)\) joining a pair of vertices \(B_1\) and \(B_2\) if and only if \(B_1\) and \(B_2\) separate each other relative \(C\). Theorem. Let \(G\) be a finite, connected graph. \(G\) is planar if and only if \(\beta(C)\) is bipartite for each circuit \(C\) in \(G\). Lemma. Let \(G\) be a finite, connected graph. \(G\) is not planar if and only if there is a circuit \(C\) of \(G\) for which \(\beta(C)\) contains a loop or a triangle. This Lemma isolates the crucial step in a new proof of the Kuratowski Theorem. It is hoped that this new proof of the Kuratowski Theorem may contain ideas which generalize to surfaces of higher genus. As there are many 2-irreducible graphs, nobody will want to list all of them. It is hoped that an analogue to our Theorem will settle the question of whether or not there are finitely many 2-irreducible graphs.
This page was built for publication: Jordan circuits of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546875)
