Neighborhood union conditions for Hamiltonicity of P₃-dominated graphs

DOI10.1007/S00373-013-1354-4MaRDI QIDQ489317zbMATH OpenOpenAlexFDO

Authors Xiaoling Ma, Vumar Elkin

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

\(P_3\)-dominated graphHamiltonicityneighborhood unionquasi-claw-free graphtraceability

Mathematics Subject Classification ID

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

Review text

The Hamiltonicity of 2-connected \(P_3\)-dominated graphs and 3-connected claw-free graphs are presented. Then, an Ore-type condition for Hamiltonicity of claw-free graphs are extended to \(P_3\)-dominated graphs. Using this condition, a neighborhood union condition for Hamiltonicity of \(P_3\)-dominated graphs is obtained.

Recommendations

• scientific article; zbMATH DE number 6806056
• On hamiltonicity of \(P_{3}\)-dominated graphs
• A new neighborhood union condition for Hamiltonian graphs
• On Hamiltonicity of 3-connected P₃-dominated graphs
• scientific article; zbMATH DE number 147624
• Neighborhood unions and hamiltonicity of graphs
• Two sufficient conditions for P₃-dominated Hamiltonian graphs
• scientific article; zbMATH DE number 29803
• Hamiltonicity, neighborhood union and partially square graphs
• scientific article; zbMATH DE number 21736

Cites work

• A neighborhood condition for vertices at distance two implying Hamiltonicity
• Almost claw‐free graphs
• Distance-dominating cycles in quasi claw-free graphs
• Global insertion and Hamiltonicity in DCT-graphs
• Hamiltonian claw-free graphs involving minimum degrees
• Hamiltonian cycles in almost claw-free graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Hamiltonicity of 2-connected quasi-claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Longest cycles in almost claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• On hamiltonicity of \(P_{3}\)-dominated graphs
• On some intriguing problems in Hamiltonian graph theory---a survey
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
• Quasi-claw-free graphs
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
• Toughness and hamiltonicity in almost claw-free graphs

Cited in

(7)

• On hamiltonicity of \(P_{3}\)-dominated graphs
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
• Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
• On Hamiltonicity of 3-connected P₃-dominated graphs
• Two sufficient conditions for P₃-dominated Hamiltonian graphs
• scientific article; zbMATH DE number 6806056 (Why is no real title available?)
• A neigborhood union condition for nonadjacent vertices in graphs

This page was built for publication: Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs

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