The 3‐connected graphs having a longest cycle containing only three contractible edges (Q4201392): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190170310 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985962973 / rank | |||
Normal rank | |||
Revision as of 18:35, 19 March 2024
scientific article; zbMATH DE number 370422
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 3‐connected graphs having a longest cycle containing only three contractible edges |
scientific article; zbMATH DE number 370422 |
Statements
The 3‐connected graphs having a longest cycle containing only three contractible edges (English)
0 references
24 August 1993
0 references
3-connected graph
0 references
longest cycle
0 references
contractible edges
0 references
