Hamilton circuits and essential girth of claw free graphs

DOI10.1007/s00373-015-1559-9zbMath1331.05127OpenAlexW2005291216MaRDI QIDQ5964993

Cun-Quan Zhang, Zheng-Ke Miao, Xiao-Feng Wang

Publication date: 2 March 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1559-9

zbMATH Keywords

closure operationclaw-free graphessential girthforbidden pairsHamilton circuitnet-free graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forbidden subgraphs and Hamiltonian properties and graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• A note on Hamiltonicity of generalized net-free graphs of large diameter
• Induced nets and Hamiltonicity of claw-free graphs
• On factors of 4-connected claw-free graphs
• Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian
• Hamiltonian results inK1,3-free graphs
• Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
• Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
• Hamiltonicity and forbidden subgraphs in 4‐connected graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs