scientific article; zbMATH DE number 238370

From MaRDI portal
Publication:5287814





Given are two theorems and the attendant lemmas on the minimum length of a longest cycle \(C\) for 3-connected claw-free graphs: (1) \(| V(C)|\geq 4\delta+ 5\) if, for some such \(C\), \(G\backslash C\) contains no Hamiltonian-connected component; (2) \(| V(C)|\geq 4k+ 5\) if \(G\) is \(k\)-regular and if for every such \(C\) all components of \(G\backslash C\) are Hamiltonian-connected.











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