Hamiltonism, degree sum and neighborhood intersections
From MaRDI portal
Publication:1175978
DOI10.1016/0012-365X(91)90094-IzbMath0746.05038MaRDI QIDQ1175978
Evelyne Flandrin, Hao Li, Heinz A. Jung
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
05C45: Eulerian and Hamiltonian graphs
Related Items
The total chromatic number of graphs having large maximum degree, Recent results on the total chromatic number, Four sufficient conditions for hamiltonian graphs, Algorithms for long paths in graphs, On covering vertices of a graph by trees, A look at cycles containing specified elements of a graph, Hamiltonism, degree sum and neighborhood intersections, Hamiltonian properties of graphs with large neighborhood unions, Long cycles, degree sums and neighborhood unions, Hamiltonian paths and hamiltonian connectivity in graphs, A closure concept based on neighborhood unions of independent triples, Neighborhood unions and Hamiltonian properties, Claw-free graphs---a survey, Longest cycles in 3-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, Global insertion and Hamiltonicity in DCT-graphs, A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs, Hamiltonian cycles in 1-tough graphs, Updating the hamiltonian problem—A survey
Cites Work
- 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
- Unnamed Item
