On the circumference of 3-connected graphs (Q1601399): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf03322759 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034955635 / rank | |||
Normal rank | |||
Latest revision as of 09:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the circumference of 3-connected graphs |
scientific article |
Statements
On the circumference of 3-connected graphs (English)
0 references
13 October 2002
0 references
Estimates for the length of a longest cycle \(C\) in a 3-connected graph \(G\) are provided. If \(H\) is a component of \(G-C\) with \(|V(H)|\geq 3\), then there exist non-adjacent vertices \(u \in V(G)\) and \(v \in V(G)-V(C)\) such that \(|C|\geq 2d(u)+2d(v)-8\), provided the vertices of \(H\) have at least 4 neighbors. This estimate can be refined if we set additional conditions on \(H\).
0 references
longest cycle
0 references
degree
0 references
