On uniquely 3-colorable graphs (Q1210549): Difference between revisions

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

Mathematics Subject Classification ID

05C15

0 references

zbMATH DE Number

179585

0 references

zbMATH Keywords

uniquely 3-colourable graph

0 references

regular graphs

0 references

reviewed by

Jozef Fiamčik

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Uniquely colorable graphs

0 references

Parallel concepts in graph theory

0 references

An introduction to chromatic polynomials

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1210549

@@ Property / reviewed by @@
-Jozef Fiamčik
@@ Property / reviewed by: Jozef Fiamčik / rank @@
-Normal rank
@@ Property / reviewed by @@
+Jozef Fiamčik
@@ Property / reviewed by: Jozef Fiamčik / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Uniquely colorable graphs
@@ Property / cites work: Uniquely colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+An introduction to chromatic polynomials
@@ Property / cites work: An introduction to chromatic polynomials / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1210549