Longest cycles in 3-connected graphs (Q1363662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Longest cycles in 3-connected graphs |
scientific article; zbMATH DE number 1047054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest cycles in 3-connected graphs |
scientific article; zbMATH DE number 1047054 |
Statements
Longest cycles in 3-connected graphs (English)
0 references
10 August 1997
0 references
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.
0 references
cycle
0 references
0.8577407598495483
0 references
0.8533647060394287
0 references
