✦ LIBER ✦

Chromatic numbers of layered graphs with a bounded maximal clique

✍ Scribed by S. L. Berlov

Book ID: 106436599
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 349 KB
Volume: 179
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-011-0610-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance graphs with large chromatic num

Distance graphs with large chromatic numbers and small clique numbers

✍ A. B. Kupavskii, A. M. Raigorodskii 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 232 KB

Lower bounds for the clique and the chro

Lower bounds for the clique and the chromatic numbers of a graph

✍ C.S. Edwards; C.H. Elphick 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 687 KB

On the connection between chromatic numb

On the connection between chromatic number, maximal clique and minimal degree of a graph

✍ B. Andrásfai; P. Erdös; V.T. Sós 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 606 KB

New bounds for the clique number of a gr

New bounds for the clique number of a graph

✍ Stanley M. Selkow 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 234 KB

A bound on the chromatic number of a gra

A bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.

A bound for the game chromatic number of

A bound for the game chromatic number of graphs

✍ Thomas Dinski; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula