✦ LIBER ✦

On Stanley's chromatic symmetric function and clawfree graphs

✍ Scribed by Vesselin Gasharov

Book ID: 108316370
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 74 KB
Volume: 205
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00106-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of certain highl

On the chromatic number of certain highly symmetric graphs

✍ P.P Pálfy 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 470 KB

On chromatic-choosable graphs

✍ Kyoji Ohba 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 70 KB

## Abstract A graph is chromatic‐choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph __G__, if we join a sufficiently large complete graph to __G__, then we obtain a chromatic‐choosable graph. As a consequence, if the chromatic number

Descents, Quasi-Symmetric Functions, Rob

Descents, Quasi-Symmetric Functions, Robinson-Schensted for Posets, and the Chromatic Symmetric Function

✍ Timothy Y. Chow 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 83 KB

On almost -degenerate -chromatic graphs

On almost -degenerate -chromatic graphs and hypergraphs

✍ Kostochka, Alexandr V. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 265 KB

On-Line 3-Chromatic Graphs I. Triangle-F

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

✍ Gyárfás, András; Király, Zoltán; Lehel, Jeno 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 460 KB

On the difference between chromatic numb

On the difference between chromatic number and dynamic chromatic number of graphs

✍ A. Ahadi; S. Akbari; A. Dehghan; M. Ghanbari 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB