✦ LIBER ✦

The First Order Theory of $N$-Colorable Graphs

✍ Scribed by William H. Wheeler

Book ID: 125678752
Publisher: American Mathematical Society
Year: 1979
Tongue: English
Weight: 478 KB
Volume: 250
Category: Article
ISSN: 0002-9947
DOI: 10.2307/1998992

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite spectra in the first order theo

Infinite spectra in the first order theory of graphs

✍ J. Spencer 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 319 KB

Succinct definitions in the first order

Succinct definitions in the first order theory of graphs

✍ Oleg Pikhurko; Joel Spencer; Oleg Verbitsky 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 471 KB

On a property of the class of n-colorabl

On a property of the class of n-colorable graphs

✍ D Seinsche 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 129 KB

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 =

General formulation of the first-order p

General formulation of the first-order perturbation graph theory

✍ Ivan Gutman 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 286 KB

The size of uniquely colorable graphs

✍ Xu Shaoji 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 79 KB