Hamiltonicity of 2-connected claw-center independent graphs

DOI10.1016/S0012-365X(96)00192-6zbMath0870.05045OpenAlexW2064420523WikidataQ128201169 ScholiaQ128201169MaRDI QIDQ1356769

Mei Lu, Bing Wei, Hao Li, Feng Tian

Publication date: 20 August 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00192-6

zbMATH Keywords

Hamilton circuitclaw-center

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Dominating cycles in regular 3-connected graphs
• Hamiltonicity in 2-connected graphs with claws
• Hamiltonian results inK1,3-free graphs
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Toughness and hamiltonicity in almost claw-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonicity of 2-connected claw-center independent graphs