scientific article; zbMATH DE number 867682

MaRDI QIDQ4873795zbMATH OpenFDO

Authors E. Schmeichel, D. Bauer, Henk Jan Veldman

Publication date 21 April 1996

zbMATH Keywords

maximum length of a cycletoughness

Mathematics Subject Classification ID

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

Cited in

(20)

• Bipartite toughness and \(k\)-factors in bipartite graphs
• Bounds on the size of graphs of given order and \(l\)-connectivity
• Long cycles, degree sums and neighborhood unions
• 1-tough cocomparability graphs are hamiltonian
• Long cycles in graphs with prescribed toughness and minimum degree
• Toughness, hamiltonicity and split graphs
• A note on dominating cycles in 2-connected graphs
• Chordality and 2-factors in tough graphs
• Toughness in graphs -- a survey
• On the Toughness of Cycle Permutation Graphs
• scientific article; zbMATH DE number 3902691 (Why is no real title available?)
• Updating the hamiltonian problem—A survey
• Toughness, minimum degree, and the existence of 2‐factors
• Toughness, minimum degree, and the existence of 2‐factors
• scientific article; zbMATH DE number 883274 (Why is no real title available?)
• Graph invariants and large cycles: a survey
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Spectral conditions of pancyclicity for t-tough graphs
• Long cycles in graphs with large degree sums
• A simple proof of a theorem of Jung

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873795)