Longest cycles in 3-connected graphs contain three contractible edges (Q3815326): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3781783 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:57, 19 June 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
