Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs (Q2552510): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q29302353, #quickstatements; #temporary_batch_1703766359865 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29302353 / rank | |||
Normal rank | |||
Revision as of 13:33, 28 December 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs |
scientific article |
Statements
Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs (English)
0 references
1973
0 references
For all \(n\geq 3\), except \(n=5,6,\) or 7 regular \(n\)-valent non-Hamiltonian non \(n\)-edge-colourable graphs are constructed by replacing edges of Petersen's graph by multiple edges, then replacing vertices with complete bipartite graphs. For \(n=5,6\), or 7, the same procedure gives graphs that are regular \(n\)-valent, Hamiltonian, and non \(n\)-edge-colourable but not \(n\)-connected.
0 references
