✦ LIBER ✦

The size of uniquely colorable graphs

✍ Scribed by Xu Shaoji

Book ID: 107884297
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 79 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90086-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniquely colorable perfect graphs

✍ Alan Tucker 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 883 KB

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 critical uniquely colorable graphs

✍ Jaroslav NešetŘil 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 167 KB

Note on the uniquely colorable graphs

✍ Chung C Wang; Ehud Artzy 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Construction of uniquely vertexk-colorab

Construction of uniquely vertexk-colorable graphs with minimum possible size

✍ Min Zhao; Li-ying Kang 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 159 KB

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