Removable circuits in multigraphs (Q1386431): Difference between revisions

It is shown that for a 2-connected multigraph \(G\) with minimum degree at least 4 and containing no Petersen minor, the multigraph \(G\) contains a circuit \(C\) such that \(G- E(C)\) is 2-connected. In addition, at least two edge-disjoint circuits of \(G\) can serve as \(C\). This result is a proof of a conjecture of \textit{Bill Jackson} [J. Lond. Math. Soc., II. Ser. 21, 385-392 (1980; Zbl 0438.05038)].