Removable circuits in multigraphs (Q1386431): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Luis A. Goddyn / rank | |||
Property / reviewed by | |||
Property / reviewed by: Wai-Kai Chen / rank | |||
Property / author | |||
Property / author: Luis A. Goddyn / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Wai-Kai Chen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2051894196 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with the Circuit Cover Property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3831045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Removable Cycles in Planar Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids with the circuit cover property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kreuzungsfreie a,b-Wege in endlichen Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cocircuit coverings and packings for binary matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3135082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-separating induced cycles in graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:35, 28 May 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