Spanning cycles in regular matroids without small cocircuits

DOI10.1016/j.ejc.2012.03.033zbMath1248.05030OpenAlexW2055114693MaRDI QIDQ449202

Yehong Shao, Hong-Jian Lai, Mingquan Zhan, Ping Li

Publication date: 12 September 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.033

zbMATH Keywords

connected simple regular matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Supereulerian regular matroids without small cocircuits ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs without spanning closed trails
• Large circuits in binary matroids of large cogirth. I
• Decomposition of regular matroids
• Matroids and multicommodity flows
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
• A note on graphs spanned by Eulerian graphs
• Graph Theory and Probability
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• Critical Point-Arboritic Graphs
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs
• Lehmans switching game and a theorem of Tutte and Nash-Williams

This page was built for publication: Spanning cycles in regular matroids without small cocircuits