Longest cycles in 3-connected graphs contain three contractible edges (Q3815326): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190130105 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057927603 / rank | |||
Normal rank | |||
Revision as of 15:40, 19 March 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
