The 3‐connected graphs having a longest cycle containing only three contractible edges (Q4201392): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.3190170310 / rank | |||
| Property / author | |||
| Property / author: R. L. Hemminger / rank | |||
| Property / author | |||
| Property / author: R. L. Hemminger / rank | |||
Normal rank | |||
| 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.3190170310 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985962973 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.3190170310 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:27, 29 December 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
