Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs (Q2552510)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3375518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs |
scientific article; zbMATH DE number 3375518 |
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
0.7519848942756653
0 references
0.7504755258560181
0 references
