✦ LIBER ✦

A note on chromatic properties of threshold graphs

✍ Scribed by Bernard Ries; Dominique de Werra; Rico Zenklusen

Book ID: 113567601
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 259 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.01.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on chromatic uniqueness of graphs

✍ G. L. Chia 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

The chromatic thresholds of graphs

✍ Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu; Morris, 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 374 KB

A Note on the Game Chromatic Index of Gr

A Note on the Game Chromatic Index of Graphs

✍ Tomasz Bartnicki; Jarosław Grytczuk 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 53 KB

A note on the strong chromatic index of

A note on the strong chromatic index of bipartite graphs

✍ K. Nakprasit 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 112 KB

A note on chromatic number and connectiv

A note on chromatic number and connectivity of infinite graphs

✍ Péter Komjáth 📂 Article 📅 2013 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 129 KB

Note on Choudum's “chromatic bounds for

Note on Choudum's “chromatic bounds for a class of graphs”

✍ Medha Javdekar 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract If a graph __G__ has no induced subgraph isomorphic to __K__~1,3′~ __K__~5~‐__e__, or a third graph that can be selected from two specific graphs, then the chromatic number of __G__ is either __d__ or __d__ + 1, where __d__ is the maximum order of a clique in __G__.