✦ LIBER ✦

Note on thenth chromatic numbers of the Gr�tzsch graph

✍ Scribed by Stahl, Saul

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 95 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199602)21:2<207::aid-jgt10>3.0.co;2-g

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that the n t h chromatic numbers of the Grotzsch graph provide the answer to an issue raised by

📜 SIMILAR VOLUMES

On the chromatic number of disk graphs

✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the vertex face total chromatic numbe

On the vertex face total chromatic number of planar graphs

✍ Weifan, Wang; Jiazhuang, Liu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 471 KB 👁 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for

On some simple degree conditions that gu

On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs

✍ Vu, Van H. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB 👁 1 views

It is well known that almost every graph in the random space G(n, p) has chromatic number of order O(np/ log(np)), but it is not clear how we can recognize such graphs without eventually computing the chromatic numbers, which is NP-hard. The first goal of this article is to show that the above-menti