scientific article; zbMATH DE number 15353

MaRDI QIDQ3971997zbMATHFDO

Authors D. Bauer, Hajo Broersma, Henk Jan Veldman

Publication date 25 June 1992

zbMATH Keywords

longest cycleHamiltonian graphdominating cycle1-tough

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Long cycles in 1-tough graphs with large degree sums
• scientific article; zbMATH DE number 837058
• Longest cycles in 3-connected graphs
• scientific article; zbMATH DE number 883274
• Hamiltonian properties of graphs with large neighborhood unions

Cited in

(8)

• A note on dominating cycles in 2-connected graphs
• \(k\)-factors and Hamilton cycles in graphs
• scientific article; zbMATH DE number 837058 (Why is no real title available?)
• Toughness in graphs -- a survey
• Hamiltonian properties of graphs with large neighborhood unions
• Long cycles, degree sums and neighborhood unions
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Long cycles in graphs containing a 2-factor with many odd components

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 Q3971997)