Hamiltonicity of 3-connected quasi-claw-free graphs.

DOI10.1016/S0012-365X(02)00882-8zbMATH Open1047.05025OpenAlexW2029786754MaRDI QIDQ1874377FDOQ1874377

Rao Li

Publication date: 25 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00882-8

zbMATH Keywords

HamiltonicityClaw-free graphsQuasi-claw-free graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Hamiltonian cycles in 3‐connected claw‐free graphs
• Quasi-claw-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Recent advances on the Hamiltonian problem: survey III
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• On hamiltonicity of \(P_{3}\)-dominated graphs
• Vertex pancyclicity in quasi-claw-free graphs
• On the circumference of 3-connected quasi-claw-free graphs
• Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
• Title not available (Why is that?)

This page was built for publication: Hamiltonicity of 3-connected quasi-claw-free graphs.

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