Hamiltonian properties of graphs with large neighborhood unions

DOI10.1016/0012-365X(91)90468-HzbMath0741.05039OpenAlexW2055532678MaRDI QIDQ1182981

Douglas Bauer, Henk Jan Veldman, Geng-Hua Fan

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90468-h

zbMATH Keywords

Hamiltonianneighborhood conditions

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (20)

Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Two new sufficient conditions for Hamilton-connected graphs ⋮ A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions ⋮ Claw-free graphs---a survey ⋮ Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle] ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Long dominating cycles in graphs ⋮ A note on dominating cycles in 2-connected graphs ⋮ Neighborhood unions and extremal spanning trees ⋮ Graphs with large maximum degree containing no odd cycles of a given length ⋮ Spanning trees: A survey ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs ⋮ One sufficient condition for Hamiltonian graphs involving distances ⋮ Toughness in graphs -- a survey ⋮ Traceability in $\{K_{1,4},K_{1,4}+e\}$-free graphs ⋮ Long cycles, degree sums and neighborhood unions ⋮ Four sufficient conditions for hamiltonian graphs ⋮ A generalization of Ore's Theorem involving neighborhood unions

Cites Work

• Long cycles in graphs with large degree sums
• Existence of Dlambda-cycles and Dlambda-paths
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonism, degree sum and neighborhood intersections
• Note on Hamilton Circuits
• Long dominating cycles and paths in graphs with large neighborhood unions
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
• Hamilton cycles in claw-free graphs
• Existence of Δλ-cycles and Δλ-paths
• On Maximal Circuits in Finite Graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian properties of graphs with large neighborhood unions