scientific article; zbMATH DE number 3906529

From MaRDI portal
Publication:3684149





We verify a conjecture of J. A. Bondy and M. Simonovits by showing that there exists a constant \(c>0\) such that every \(3\)-connected cubic graph \(G\) has a cycle of length at least \(| G|^c\).











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