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.
Recommendations
Cited in
(10)- Longest cycles in regular graphs
- Longest cycles in regular 2-connected claw-free graphs
- Circumferences of regular claw-free graphs
- scientific article; zbMATH DE number 4212091 (Why is no real title available?)
- Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
- scientific article; zbMATH DE number 94049 (Why is no real title available?)
- scientific article; zbMATH DE number 147641 (Why is no real title available?)
- scientific article; zbMATH DE number 1150168 (Why is no real title available?)
- scientific article; zbMATH DE number 205838 (Why is no real title available?)
- Connectivity and cycles in graphs
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)