A short proof of a conjecture

MaRDI QIDQ3538464zbMATH OpenFDO

Authors Bing Wang

Publication date 24 November 2008

zbMATH Keywords

Hamiltonian\(k\)-factor\(t\)-tough

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Counterexample to a conjecture on Hamilton cycles
• On a conjecture of A. Ainouche and N. Christofides
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
• A short proof of a theorem on Hamiltonian graphs

Cited in

(3)

• On a conjecture of A. Ainouche and N. Christofides
• A short proof of the versatile version of Fleischner's theorem
• A Short Proof of a Concrete Sum

This page was built for publication: A short proof of a conjecture

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