A generalization of Ore's Theorem involving neighborhood unions
From MaRDI portal
Publication:1313847
DOI10.1016/0012-365X(93)90285-2zbMath0789.05058MaRDI QIDQ1313847
Hajo J. Broersma, Henk Jan Veldman, Jan van den Heuvel
Publication date: 10 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (16)
Neighborhood unions and hamilton cycles ⋮ Neighborhood unions and hamiltonicity of graphs ⋮ 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 ⋮ Connectivity, traceability and Hamiltonicity ⋮ The neighborhood union of independent sets and hamiltonicity of graphs ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ Hamiltonian graphs involving distances ⋮ Neighborhood conditions for balanced independent sets in bipartite graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Leaf number and Hamiltonian \(C_4\)-free graphs ⋮ A new neighborhood union condition for Hamiltonian graphs ⋮ Spanning paths in graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning paths and cycles in triangle-free graphs ⋮ The ubiquitous Petersen graph
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
This page was built for publication: A generalization of Ore's Theorem involving neighborhood unions
