Removable circuits in multigraphs

DOI10.1006/jctb.1997.1775zbMath0901.05060OpenAlexW2051894196MaRDI QIDQ1386431

Jan van den Heuvel, Luis A. Goddyn

Publication date: 2 December 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bdb7fed1b3085886985ed032113df74814b1c881

zbMATH Keywords

multigraphcircuit

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights., On removable even circuits in graphs, Hamilton weights and Petersen minors, Removable cycles avoiding two connected subgraphs, Generation and properties of snarks, Connected hyperplanes in binary matroids, Contractible bonds in graphs, Cycle covers (I) - minimal contra pairs and Hamilton weights, On decomposing a graph into nontrivial bonds, On removable circuits in graphs and matroids, Note on non-separating and removable cycles in highly connected graphs, Removing circuits in 3-connected binary matroids, Triangle-free circuit decompositions and Petersen minor, Non-separating cocircuits in binary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Non-separating induced cycles in graphs
• Matroids with the circuit cover property
• Graph minors. XIII: The disjoint paths problem
• Kreuzungsfreie a,b-Wege in endlichen Graphen
• Removable Cycles in Planar Graphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• Cocircuit coverings and packings for binary matroids
• Graphs with the Circuit Cover Property