𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forbidden subgraph colorings and the oriented chromatic number

✍ Scribed by N.R. Aravind; C.R. Subramanian

Book ID
118275949
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
279 KB
Volume
34
Category
Article
ISSN
0195-6698

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

Subgraphs of large connectivity and chro
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.