On removable circuits in graphs and matroids

DOI<51::AID-JGT6>3.0.CO;2-7 10.1002/(SICI)1097-0118(199901)30:1<51::AID-JGT6>3.0.CO;2-7zbMath0933.05086OpenAlexW4234785913MaRDI QIDQ4256106

Manoel Lemos, James G. Oxley

Publication date: 4 April 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199901)30:1<51::aid-jgt6>3.0.co;2-7

zbMATH Keywords

cyclemethod2-connected graphremovable circuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items

On removable even circuits in graphs, Removable cycles avoiding two connected subgraphs, The 3-connected matroids with circumference 6, Connected hyperplanes in binary matroids, Contractible bonds in graphs, Removing circuits in 3-connected binary matroids, Non-separating cocircuits in binary matroids, The 3-connected binary matroids with circumference 6 or 7

Cites Work

• Unnamed Item
• Unnamed Item
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Removable circuits in multigraphs
• On size, circumference and circuit removal in 3-connected matroids
• On packing minors into connected matroids
• Kreuzungsfreie a,b-Wege in endlichen Graphen
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• Some Theorems on Abstract Graphs