The author shows that in a non-Hamiltonian 3-connected graph there exist a cycle \(C\) and three independent vertices \(u_1\), \(u_2\), \(u_3\) such that \(| C|\geq d(u_1)+ d(u_2)+ d(u_3)- | N(u_1)\cap N(u_2)\cap N(u_3)|\), where \(d(u_i)= | N(u_i)|\) is the degree of \(u_i\) \((i= 1,2,3)\). Some corollaries are supplied.
Recommendations
Cites work
Cited in
(20)- Cycles through three vertices in 2-connected graphs
- Bridges of longest cycles
- The cycle space of a 3-connected Hamiltonian graph
- On cycles in 3-connected graphs
- On the circumference of 3-connected graphs
- Degree sum conditions on two disjoint cycles in graphs
- Long cycles in 3-connected graphs
- Longest cycles in 4-connected graphs
- Relative length of longest paths and cycles in 3-connected graphs
- Longest cycles in 3-connected graphs contain three contractible edges
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- scientific article; zbMATH DE number 15353 (Why is no real title available?)
- scientific article; zbMATH DE number 108282 (Why is no real title available?)
- scientific article; zbMATH DE number 568790 (Why is no real title available?)
- Spanning trees with a bounded number of leaves
- Long cycles in 3‐connected graphs in orientable surfaces
- Long cycles passing through a specified edge in 3-connected graphs
- Algorithms for long paths in graphs
- Longest cycles in 3-connected planar graphs
- Algorithm for two disjoint long paths in 2-connected graphs
This page was built for publication: Longest cycles in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363662)
