Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs

DOI10.1080/00207160.2013.858808zbMath1305.05124OpenAlexW2040576723MaRDI QIDQ2935385

Ping Li, Jin-Quan Xu, Hong-Jian Lai, Zheng-Ke Miao, Ke-ke Wang

Publication date: 29 December 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

reductionssupereulerian graphscollapsible graphscontraction characterizations

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Constructing featured supereulerian graph ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Locally dense supereulerian digraphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ On the independence number of traceable 2-connected claw-free graphs ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Supereulerian graphs in the graph family \(C_{2}(6,k)\)
• Supereulerian graphs and matchings
• The supereulerian graphs in the graph family \(C(l,k)\)
• Graphs without spanning closed trails
• On a closure concept in claw-free graphs
• A note on minimum degree conditions for supereulerian graphs
• A note on Hamiltonian circuits
• 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
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs