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

DOI10.1007/S00373-013-1354-4zbMath1307.05134OpenAlexW1985493255MaRDI QIDQ489317

Xiaoling Ma, Elkin Vumar

Publication date: 20 January 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1354-4

zbMATH Keywords

Hamiltonicityneighborhood uniontraceability\(P_3\)-dominated graphquasi-claw-free 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 (1)

A neigborhood union condition for nonadjacent vertices in graphs

Cites Work

• Unnamed Item
• On hamiltonicity of \(P_{3}\)-dominated graphs
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian properties of graphs with large neighborhood unions
• 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 2-connected quasi-claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Hamiltonian claw-free graphs involving minimum degrees
• Hamiltonicity in 3-connected claw-free graphs
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
• Longest paths and cycles in K1,3-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: Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs