scientific article; zbMATH DE number 837058

DOI<87::AID-JGT12>3.0.CO;2-P 10.1002/(SICI)1097-0118(199601)21:1<87::AID-JGT12>3.0.CO;2-PzbMath0840.05046MaRDI QIDQ4862113

Jan van den Heuvel

Publication date: 4 July 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

independence numberHamilton cycles1-tough graphsDirac's classical theoremHopping Lemma

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Degree sums and spanning brooms of a graph, Toughness and spectrum of a graph, Degree Conditions for Spanning Brooms, Application of convolution theorems in semiparametric models with non-i. i. d. data