A generalization of a result of Häggkvist and Nicoghossian

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

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

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

connectivity; Hamiltonian graph; degree condition; Bondy-Chvátal closure theorem

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Computation of the 0-dual closure for hamiltonian graphs, Edge bounds in nonhamiltonian \(k\)-connected graphs, 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, A generalization of a result of Bauer and Schmeichel, Cycles through subsets with large degree sums, A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs, Degree sum and connectivity conditions for dominating cycles, Toughness in graphs -- a survey, A Remark on Hamiltonian Cycles

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