𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotics of the Chromatic Number for Quasi-Line Graphs

✍ Scribed by Andrew D. King; Bruce Reed

Book ID
112121140
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
584 KB
Volume
73
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 198 KB πŸ‘ 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

On the Chromatic Number of Graphs
On the Chromatic Number of Graphs
✍ S. Butenko; P. Festa; P. M. Pardalos πŸ“‚ Article πŸ“… 2001 πŸ› Springer 🌐 English βš– 174 KB
New bounds for the chromatic number of g
New bounds for the chromatic number of graphs
✍ Manouchehr Zaker πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 184 KB πŸ‘ 1 views

## Abstract In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11. Next, we obtain an upper bound of the order of magnitude ${\cal O}({n}^{{1}-\epsilon})$ for the coloring number of a graph