Hamiltonism, degree sum and neighborhood intersections
From MaRDI portal
Publication:1175978
DOI10.1016/0012-365X(91)90094-IzbMath0746.05038OpenAlexW2047452025MaRDI QIDQ1175978
Heinz A. Jung, Hao Li, Evelyne Flandrin
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90094-i
Related Items
Neighborhood unions and Hamiltonian properties ⋮ Updating the hamiltonian problem—A survey ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Claw-free graphs---a survey ⋮ Longest cycles in 3-connected graphs ⋮ Longest cycles in 4-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Algorithms for long paths in graphs ⋮ On \((2, k)\)-Hamilton-connected graphs ⋮ Graphs with large maximum degree containing no odd cycles of a given length ⋮ The total chromatic number of graphs of even order and high degree ⋮ A condition ensuring that a connected graph has a spanning tree with few leaves ⋮ Hamiltonism, degree sum and neighborhood intersections ⋮ Spanning trees: A survey ⋮ Hamiltonian properties of graphs with large neighborhood unions ⋮ On covering vertices of a graph by trees ⋮ The total chromatic number of graphs having large maximum degree ⋮ Recent results on the total chromatic number ⋮ The \(k\)-dominating cycles in graphs ⋮ Algorithm for two disjoint long paths in 2-connected graphs ⋮ Hamiltonian cycles in 1-tough graphs ⋮ A look at cycles containing specified elements of a graph ⋮ Global insertion and Hamiltonicity in DCT-graphs ⋮ Long cycles, degree sums and neighborhood unions ⋮ Hamiltonian paths and hamiltonian connectivity in graphs ⋮ Four sufficient conditions for hamiltonian graphs ⋮ A closure concept based on neighborhood unions of independent triples
Cites Work
- Unnamed Item
- Neighbourhood unions and Hamiltonian properties in graphs
- Hamiltonism, degree sum and neighborhood intersections
- A method in graph theory
- Note on Hamilton Circuits
- Longest paths and cycles in K1,3-free graphs
- A new sufficient condition for hamiltonian graphs
- Hamilton cycles in claw-free graphs
