𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On critical uniquely colorable graphs

✍ Scribed by Jaroslav NešetŘil

Book ID
112511839
Publisher
Springer
Year
1972
Tongue
English
Weight
167 KB
Volume
23
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On uniquely 3-colorable graphs
On uniquely 3-colorable graphs
✍ Chong-Yun Chao; Zhibo Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 415 KB

We show the following. (1) For each integer n> 12, there exists a uniquely 3-colorable graph with n vertices and without any triangles. (2) There exist infinitely many uniquely 3-colorable regular graphs without any triangles. It follows that there exist infinitely many uniquely k-colorable regular

On uniquely 3-colorable graphs II
On uniquely 3-colorable graphs II
✍ Chong-Yun Chao; Zhibo Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 428 KB

In [2], for each non-negative integer k, we constructed a connected graph with (24)2k vertices which is uniquely 3-colorable, regular with degree k+5, and triangle-free. Here, for each positive integer n and each integer r > 5, we construct a connected graph with (26)n .2'-' vertices which is unique