Removable circuits in multigraphs (Q1386431): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051894196 / rank | |||
Normal rank | |||
Revision as of 01:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Removable circuits in multigraphs |
scientific article |
Statements
Removable circuits in multigraphs (English)
0 references
2 December 1998
0 references
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)].
0 references
multigraph
0 references
circuit
0 references
