๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some classes of uniquely 3-colorable graphs

โœ Scribed by Leon J. Osterweil

Book ID
107748184
Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
876 KB
Volume
8
Category
Article
ISSN
0012-365X

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