Longest cycles in 3-connected graphs contain three contractible edges (Q3815326): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1050354 |
Changed an Item |
||
| Property / author | |||
| Property / author: R. L. Hemminger / rank | |||
Normal rank | |||
Revision as of 10:42, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest cycles in 3-connected graphs contain three contractible edges |
scientific article |
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
