No label defined (Q4376500)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1117463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1117463 |
Statements
7 September 1998
0 references
cycles
0 references
0.862345814704895
0 references
0.8508914113044739
0 references
The authors prove the following results: (1) With the exception of the complete graphs on one and two vertices, every simple graph having at most two vertices of degree less than three contains two cycles whose lengths differ by one or two. (2) Every non-bipartite 3-connected graph has two cycles whose lengths differ by one. They also conjecture that for any natural number \(k\) there are at most finitely many simple graphs having at most \(k\) vertices of degree less than three but no two cycles whose lengths differ by one or two.
0 references
