Spanning cycles in regular matroids without small cocircuits
From MaRDI portal
Publication:449202
DOI10.1016/J.EJC.2012.03.033zbMATH Open1248.05030OpenAlexW2055114693MaRDI QIDQ449202FDOQ449202
Authors: Hong-Jian Lai, Yehong Shao, 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
Recommendations
Cites Work
- Graph theory
- Decomposition of regular matroids
- Title not available (Why is that?)
- Graph Theory and Probability
- Graphs without spanning closed trails
- 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
- A note on graphs spanned by Eulerian graphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- Matroids and multicommodity flows
- Critical Point-Arboritic Graphs
- A Note on Sub-Eulerian Graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Large circuits in binary matroids of large cogirth. I
- Title not available (Why is that?)
Cited In (7)
- Dominating circuits in regular matroids
- Spanning circuits in regular matroids
- Cycle cover ratio of regular matroids
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Spanning circuits in regular matroids
- Supereulerian regular matroids without small cocircuits
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
This page was built for publication: Spanning cycles in regular matroids without small cocircuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449202)
