A generalization of Ore's Theorem involving neighborhood unions

DOI10.1016/0012-365X(93)90285-2zbMath0789.05058MaRDI QIDQ1313847

Jan van den Heuvel, Hajo J. Broersma, Henk Jan Veldman

Publication date: 10 March 1994

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

zbMATH Keywords

connectivity; Petersen graph; hamiltonian; generalization of Ore's theorem

Mathematics Subject Classification ID

05C38: Paths and cycles

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

Related Items

A new neighborhood union condition for Hamiltonian graphs, The ubiquitous Petersen graph, Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs, Lower bounds of length of longest cycles in graphs involving neighborhood unions, Neighborhood conditions for balanced independent sets in bipartite graphs, Neighborhood unions and hamiltonicity of graphs, The neighborhood union of independent sets and hamiltonicity of graphs, Neighborhood unions and hamilton cycles, Hamiltonian graphs involving distances

Cites Work

• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• Existence of Dlambda-cycles and Dlambda-paths
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Neighborhood unions and a generalization of Dirac's theorem
• Note on Hamilton Circuits
• Long dominating cycles and paths in graphs with large neighborhood unions
• Neighborhood unions and hamilton cycles
• Some Theorems on Abstract Graphs