On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs

DOI10.1007/s00373-008-0805-9zbMath1193.05072OpenAlexW2088061912MaRDI QIDQ1014832

Jiangyan Guo, Elkin Vumar

Publication date: 29 April 2009

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

Full work available at URL: https://doi.org/10.1007/s00373-008-0805-9

zbMATH Keywords

Hamiltonian graphcircumferencequasi-claw-free graph\(P_{3}\)-dominated graph

Mathematics Subject Classification ID

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

Related Items

Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs

Cites Work

• On hamiltonicity of \(P_{3}\)-dominated graphs
• Longest paths joining given vertices in a graph
• Quasi-claw-free graphs
• Hamiltonicity of 2-connected quasi-claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• On the circumference of 3-connected quasi-claw-free graphs
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Cycles and Connectivity in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item