scientific article; zbMATH DE number 15353

zbMATH Open0736.05054MaRDI QIDQ3971997FDOQ3971997

D. Bauer, Hajo Broersma, Henk Jan Veldman

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

zbMATH Keywords

longest cycleHamiltonian graphdominating cycle1-tough

Mathematics Subject Classification ID

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

Cited In (8)

• Toughness in graphs -- a survey
• A note on dominating cycles in 2-connected graphs
• \(k\)-factors and Hamilton cycles in graphs
• Title not available (Why is that?)
• Long cycles in graphs containing a 2-factor with many odd components
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Long cycles, degree sums and neighborhood unions
• Hamiltonian properties of graphs with large neighborhood unions

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Longest cycles in 3-connected graphs 👍 👎
• Hamiltonian properties of graphs with large neighborhood unions 👍 👎
• Long cycles in 1-tough graphs with large degree sums 👍 👎

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)