scientific article; zbMATH DE number 867682

zbMath0840.05049MaRDI QIDQ4873795

Edward F. Schmeichel, Henk Jan Veldman, Douglas Bauer

Publication date: 21 April 1996

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

zbMATH Keywords

toughnessmaximum length of a cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Updating the hamiltonian problem—A survey ⋮ Long cycles in graphs with prescribed toughness and minimum degree ⋮ 1-tough cocomparability graphs are hamiltonian ⋮ Toughness, minimum degree, and the existence of 2‐factors ⋮ Toughness, hamiltonicity and split graphs ⋮ A note on dominating cycles in 2-connected graphs ⋮ Toughness, minimum degree, and the existence of 2‐factors ⋮ A simple proof of a theorem of Jung ⋮ Chordality and 2-factors in tough graphs ⋮ On the Toughness of Cycle Permutation Graphs ⋮ Graph invariants and large cycles: a survey ⋮ Toughness in graphs -- a survey ⋮ Bipartite toughness and \(k\)-factors in bipartite graphs ⋮ Long cycles in graphs with large degree sums ⋮ Unnamed Item ⋮ Bounds on the size of graphs of given order and \(l\)-connectivity ⋮ Long cycles, degree sums and neighborhood unions