The supereulerian graphs in the graph family \(C(l,k)\)

DOI10.1016/J.DISC.2008.06.038zbMath1200.05126OpenAlexW2035101446MaRDI QIDQ1043654

Hong-Jian Lai, Dengxin Li, Xiao-Min Li

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.038

zbMATH Keywords

contractionreductionHamilton-connectedsupereulerian graphscollapsible graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ On extremal \(k\)-supereulerian graphs ⋮ Group connectivity in 3-edge-connected graphs ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ Spanning Eulerian subgraphs of 2-edge-connected graphs ⋮ Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs without spanning closed trails
• A note on minimum degree conditions for supereulerian graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: The supereulerian graphs in the graph family \(C(l,k)\)