On hamiltonicity of \(P_{3}\)-dominated graphs

DOI10.1007/s00186-008-0260-7zbMath1161.05331OpenAlexW2056463515MaRDI QIDQ1014310

Elkin Vumar, Hajo J. Broersma

Publication date: 27 April 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-008-0260-7

zbMATH Keywords

claw-free graphHamiltonian cyclequasi-claw-free graph\(P_{3}\)-dominated graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

On 3-connected Hamiltonian line graphs ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Longest paths joining given vertices in a graph
• Quasi-claw-free graphs
• Longest cycles in almost claw-free graphs
• Global insertion and Hamiltonicity in DCT-graphs
• On some intriguing problems in Hamiltonian graph theory---a survey
• Distance-dominating cycles in quasi claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Almost claw‐free graphs
• Toughness and hamiltonicity in almost claw-free graphs
• Hamiltonian cycles in almost claw-free graphs

This page was built for publication: On hamiltonicity of \(P_{3}\)-dominated graphs