𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every Monotone 3‐Graph Property is Testable

✍ Scribed by Avart, Christian; Rödl, Vojtěch; Schacht, Mathias

Book ID
118196932
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
264 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Every 3-connected claw-free Z8-free grap
Every 3-connected claw-free Z8-free graph is Hamiltonian
✍ Hong-Jian Lai; Liming Xiong; Huiya Yan; Jin Yan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

## Abstract In this article, we first show that every 3‐edge‐connected graph with circumference at most 8 is supereulerian, which is then applied to show that a 3‐connected claw‐free graph without __Z__~8~ as an induced subgraph is Hamiltonian, where __Z__~8~ denotes the graph derived from identify

Every circle graph of girth at least 5 i
Every circle graph of girth at least 5 is 3-colourable
✍ A.A. Ageev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 235 KB

It is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-colourable and that there exist examples of these graphs which are not 4-colourable . In this note we show that every circle graph of girth at least 5 is 2-degenerate and, consequently, not only 3-colourable