𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete oriented colourings and the oriented achromatic number

✍ Scribed by Sopena, Éric

Book ID
123288824
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
484 KB
Volume
173
Category
Article
ISSN
0166-218X

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 Number of Nonisomorphic Orientabl
On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs
✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

Circular Colouring and Orientation of Gr
Circular Colouring and Orientation of Graphs
✍ Xuding Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

This paper proves that if a graph G has an orientation D such that for each cycle C with djCj ðmod kÞ 2 f1; 2; . . . ; 2d À 1g we have jCj=jC þ j4k=d and jCj=jC À j4k=d; then G has a ðk; dÞ-colouring and hence w c ðGÞ4k=d: This is a generalization of a result of Tuza (J. Combin. Theory Ser. B 55 (19