On uniquely 3-colorable graphs (Q1210549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On uniquely 3-colorable graphs |
scientific article; zbMATH DE number 179585
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On uniquely 3-colorable graphs |
scientific article; zbMATH DE number 179585 |
Statements
On uniquely 3-colorable graphs (English)
0 references
30 August 1993
0 references
The authors show: (1) For each integer \(m\geq 12\), there exists a uniquely 3-colourable graph of order \(m\) without triangles. (2) For each integer \(n\geq 3\), there exists infinitely many uniquely \(n\)-colourable regular graphs having no subgraph isomorphic to the complete graph \(K_ n\) on \(n\) vertices.
0 references
uniquely 3-colourable graph
0 references
regular graphs
0 references
