Supereulerian regular matroids without small cocircuits

DOI10.1002/jgt.22860OpenAlexW4285727107MaRDI QIDQ6093141

No author found.

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22860

zbMATH Keywords

supereulerian graphsdisjoint bases of matroidsspanning cyclescontractible restrictionsfractional arboricity of a matroidstrength of a matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning cycles in regular matroids without small cocircuits
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Graphs without spanning closed trails
• Large circuits in binary matroids of large cogirth. I
• Decomposition of regular matroids
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Cycle cover ratio of regular matroids
• Vertex-connectivity and eigenvalues of graphs with fixed girth
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
• A note on graphs spanned by Eulerian graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Contractions and hamiltonian line 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: Supereulerian regular matroids without small cocircuits