A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form” (Q3960873): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Alexander K. Kelmans / rank | |||
| Property / author | |||
| Property / author: Q585079 / rank | |||
| Property / author | |||
| Property / author: Alexander K. Kelmans / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael V. Lomonosov / 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.3190060415 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124571105 / rank | |||
Normal rank | |||
Latest revision as of 01:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form” |
scientific article |
Statements
A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form” (English)
0 references
1982
0 references
cubic 3-connected graph
0 references
Petersen graph
0 references
