Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

DOI10.1016/j.endm.2005.06.017zbMath1182.05065MaRDI QIDQ3439314

Limning Xiong, Ming-Chu Li

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.017

zbMATH Keywords

claw-free graph; circumference; longest cycle

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

Related Items

Circumferences and minimum degrees in 3-connected claw-free graphs, Hamiltonian claw-free graphs involving minimum degrees, Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Cites Work

• Unnamed Item
• On a closure concept in claw-free graphs
• Eulerian subgraphs containing given vertices and hamiltonian line graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• A reduction method to find spanning Eulerian subgraphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Hamiltonian connectedness in claw-free graphs