✦ LIBER ✦

Uniquely colorable perfect graphs

✍ Scribed by Alan Tucker

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 883 KB
Volume: 44
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90059-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Kr-Free Uniquely Vertex Colorable Graphs

Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges

✍ S. Akbari; V.S. Mirrokni; B.S. Sadjad 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 112 KB

We construct counterexamples to the conjecture of Xu (1990, J. Combin. Theory Ser. B 50, 319 320) that every uniquely r-colorable graph of order n with exactly (r&1) n&( r2 ) edges must contain a K r . ## 2001 Academic Press Harary et al. [4] constructed uniquely r-colorable graphs containing no

On graphs uniquely colorable under the a

On graphs uniquely colorable under the action of their automorphism groups

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Cubic graphs with three Hamiltonian cycl

Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable

✍ Andrew Thomason 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract The generalized Petersen graph __P__(6__k__ + 3, 2) has exactly 3 Hamiltonian cycles for __k__ ≥ 0, but for __k__ ≥ 2 is not uniquely edge colorable. This disproves a conjecture of Greenwell and Kronk [1].

Coloring precolored perfect graphs

✍ Kratochv�l, Jan; Seb?, Andr�s 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We consider the question of the computational complexity of coloring perfect graphs with some precolored vertices. It is well known that a perfect graph can be colored optimally in polynomial time. Our results give a sharp border between the polynomial and NP-complete instances, when precolored vert

Graphs with unique Ramsey colorings

✍ Jerrold W. Grossman 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB