Spanning cycles in regular matroids without small cocircuits
From MaRDI portal
(Redirected from Publication:449202)
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 4006296 (Why is no real title available?)
- A Note on Sub-Eulerian Graphs
- A note on graphs spanned by Eulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- Critical Point-Arboritic Graphs
- Decomposition of regular matroids
- Edge-Disjoint Spanning Trees of Finite Graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Graph Theory and Probability
- Graph theory
- Graphs without spanning closed trails
- Large circuits in binary matroids of large cogirth. I
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Matroids and multicommodity flows
- On the Problem of Decomposing a Graph into n Connected Factors
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
Cited in
(7)- Dominating circuits in regular matroids
- Supereulerian regular matroids without small cocircuits
- Spanning circuits in regular matroids
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Spanning circuits in regular matroids
- Cycle cover ratio of regular matroids
- 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)
