Supereulerian regular matroids without small cocircuits

DOI10.1002/JGT.22860MaRDI QIDQ6093141zbMATH OpenOpenAlexFDO

Authors

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

contractible restrictionsdisjoint bases of matroidsfractional arboricity of a matroidspanning cyclesstrength of a matroidsupereulerian graphs

Mathematics Subject Classification ID

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

Recommendations

• Spanning cycles in regular matroids without small cocircuits
• Circuits through cocircuits in a graph with extensions to matroids
• Large circuits in binary matroids of large cogirth. I
• Circuits and cocircuits in regular matroids
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors

Cites work

• A note on graphs spanned by Eulerian graphs
• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Contractions and hamiltonian line graphs
• Critical Point-Arboritic Graphs
• Cycle cover ratio of regular matroids
• Decomposition of regular matroids
• Edge-Disjoint Spanning Trees of Finite Graphs
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Graph theory
• Graphs without spanning closed trails
• scientific article; zbMATH DE number 4006296 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Large circuits in binary matroids of large cogirth. I
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• On the Problem of Decomposing a Graph into n Connected Factors
• Optimal attack and reinforcement of a network
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
• Spanning cycles in regular matroids without small cocircuits
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Vertex-connectivity and eigenvalues of graphs with fixed girth

Cited in

(2)

• Vertex degree sums for supereulerian bipartite digraphs
• Supereulerian of regular matroids with cogirth conditions

This page was built for publication: Supereulerian regular matroids without small cocircuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093141)