✦ LIBER ✦

Almost all k-colorable graphs are easy to color

✍ Scribed by Jonathan S Turner

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 972 KB
Volume: 9
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(88)90005-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Why Almost Allk-Colorable Graphs Are Eas

Why Almost Allk-Colorable Graphs Are Easy to Color

✍ Amin Coja-Oghlan; Michael Krivelevich; Dan Vilenchik 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 910 KB

Almost all graphs with average degree 4

Almost all graphs with average degree 4 are 3-colorable

✍ Dimitris Achlioptas; Cristopher Moore 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 323 KB

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., Gðn; p ¼ d=nÞ; are 3-colorable and that a constant fraction of all 4-regular graphs are 3-colorable.

All Unit-Distance Graphs of Order 6197 A

All Unit-Distance Graphs of Order 6197 Are 6-Colorable

✍ Dan Pritikin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Consider any 6197 or fewer points in the plane, and create a graph with this vertex set by considering a pair of those points to be adjacent if and only if their distance is exactly 1. It is shown that the vertices of the resulting graph can be properly 6-colored. 1998 Academic Press Consider R 2 =

How could prebiotic molecules make the c

How could prebiotic molecules make the code and how all this is related to proteins?: Reply to comments on “A colorful origin to the genetic code” by H. Takagi, K. Kaneko and R. Wallace

✍ Tsvi Tlusty 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 83 KB

I am grateful to the commentators for bringing up two fundamental questions that are in fact related. Takagi and Kaneko look into a concrete molecular mechanism that could lead to the emergence of the genetic code [1], while Wallace takes the rate-distortion paradigm to the realm of proteins and ask