On uniquely 3-colorable graphs (Q1210549): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Uniquely colorable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to chromatic polynomials / rank | |||
Normal rank | |||
Latest revision as of 16:59, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On uniquely 3-colorable graphs |
scientific article |
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
