On a conjecture of Bondy and Vince

From MaRDI portal
Publication:2284740



Abstract: Twenty years ago Bondy and Vince conjectured that for any nonnegative integer k, except finitely many counterexamples, every graph with k vertices of degree less than three contains two cycles whose lengths differ by one or two. The case kleq2 was proved by Bondy and Vince, which resolved an earlier conjecture of ErdH{o}s et. al.. In this paper we confirm this conjecture for all k.












This page was built for publication: On a conjecture of Bondy and Vince

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