Catlin’s reduced graphs with small orders

DOI10.1080/09728600.2020.1832875zbMath1472.05087OpenAlexW3097963540MaRDI QIDQ5012362

Xiaowei Xie, Mingquan Zhan, Hong-Jian Lai, Ke-ke Wang

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2020.1832875

zbMATH Keywords

Eulerian graphscollapsible graphsreduced graphs

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Collapsible graphs and Hamiltonian connectedness of line graphs
• On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
• Spanning subgraph with Eulerian components
• Spanning trails containing given edges
• Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
• The structure of even factors in claw-free graphs
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• Degree sum and Hamiltonian-connected line graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Hamiltonian iterated line graphs
• Contractions and hamiltonian line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• A Note on Sub-Eulerian Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs and the Petersen graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Catlin’s reduced graphs with small orders