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

DOI10.1080/00207160.2013.858808MaRDI QIDQ2935385zbMATH OpenOpenAlexFDO

Authors Jinquan Xu, Ping Li, Hong-Jian Lai, Zhengke 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

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

Recommendations

• Supereulerian graphs and small matching number
• Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
• Supereulerian graphs with constraints on the matching number and minimum degree
• scientific article; zbMATH DE number 6819543
• Supereulerian graphs and matchings

Cites work

• A note on Hamiltonian circuits
• A note on graphs spanned by Eulerian graphs
• A note on minimum degree conditions for supereulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Graphs without spanning closed trails
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs
• Supereulerian graphs and matchings
• Supereulerian graphs in the graph family \(C_{2}(6,k)\)
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• The supereulerian graphs in the graph family \(C(l,k)\)

Cited in

(10)

• A condition on Hamilton-connected line graphs
• Supereulerian graphs and small matching number
• Supereulerian graphs with constraints on the matching number and minimum degree
• On the independence number of traceable 2-connected claw-free graphs
• Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
• Chvátal-Erdős conditions and almost spanning trails
• Constructing featured supereulerian graph
• Locally dense supereulerian digraphs
• Supereulerian digraphs with large arc-strong connectivity
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs

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

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