Longest cycles in 3-connected graphs contain three contractible edges (Q3815326)
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 4085686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest cycles in 3-connected graphs contain three contractible edges |
scientific article; zbMATH DE number 4085686 |
Statements
Longest cycles in 3-connected graphs contain three contractible edges (English)
0 references
1989
0 references
longest path
0 references
longest cycles
0 references
contractible edges
0 references
0 references
0.9731618
0 references
0.9486411
0 references
0.9343989
0 references
0 references
