A generalization of a result of Häggkvist and Nicoghossian

DOI10.1016/0095-8956(89)90023-3zbMath0634.05053OpenAlexW1967350548MaRDI QIDQ1096650

Douglas Bauer, Li Rao, Henk Jan Veldman, Hajo J. Broersma

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/a-generalization-of-a-result-of-haggkvist-and-nicoghossian(6bde149e-6bbd-4511-b032-6adf5c5ba092).html

zbMATH Keywords

connectivityHamiltonian graphdegree conditionBondy-Chvátal closure theorem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (21)

A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Cycles through subsets with large degree sums ⋮ Some local-global phenomena in locally finite graphs ⋮ Edge bounds in nonhamiltonian \(k\)-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ A Remark on Hamiltonian Cycles ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ Computation of the 0-dual closure for hamiltonian graphs ⋮ Degree sum and connectivity conditions for dominating cycles ⋮ A localization method in Hamiltonian graph theory ⋮ Hamiltonicity of 4-connected graphs ⋮ Toughness in graphs -- a survey ⋮ A degree sum condition concerning the connectivity and the independence number of a graph ⋮ Hamiltonian cycles and dominating cycles passing through a linear forest ⋮ A look at cycles containing specified elements of a graph ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles ⋮ A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs ⋮ On the length of longest dominating cycles in graphs ⋮ Wheel and star-critical Ramsey numbers for quadrilateral ⋮ A generalization of a result of Bauer and Schmeichel

Cites Work

• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• A remark on Hamiltonian cycles
• A method in graph theory
• A note on Hamiltonian circuits
• Some Theorems on Abstract Graphs

This page was built for publication: A generalization of a result of Häggkvist and Nicoghossian