Supereulerian graphs in the graph family \(C_{2}(6,k)\)

DOI10.1016/J.DAM.2010.12.005zbMath1219.05086OpenAlexW2140599701MaRDI QIDQ628342

Yanting Liang, Hong-Jian Lai

Publication date: 10 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.005

zbMATH Keywords

contractionreductionsupereulerian graphscollapsible graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ On extremal \(k\)-supereulerian graphs ⋮ Graphs with a 3-cycle-2-cover ⋮ Spanning Eulerian subgraphs of 2-edge-connected graphs ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Spanning trails in essentially 4-edge-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
• The supereulerian graphs in the graph family \(C(l,k)\)
• Graphs without spanning closed trails
• Eulerian graphs and related topics. Part 1, Volume 1
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• A note on minimum degree conditions for supereulerian graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Supereulerian graphs in the graph family \(C_{2}(6,k)\)