Opening book details…
Can I read Acyclic and Oriented Chromatic Numbers of Graphs on EtoBox?
Acyclic and Oriented Chromatic Numbers of Graphs by A. V. Kostochka; E. Sopena; X. Zhu is a Computer Science article available to read on EtoBox.
What is Acyclic and Oriented Chromatic Numbers of Graphs about?
The oriented chromatic number χ o ( G) of an oriented graph G = (V, A) is the minimum number of vertices in an oriented graph H for which there exists a homomorphism of G to H. The oriented chromatic number χ o (G) of an undirected graph G is the maximum of the oriented chromatic numbers of all the orientations of G. This paper discusses the relations between the oriented chromatic number and the acyclic chromatic number and some other parameters of a graph. We shall give a lower bound for χ o (G) in terms of χ a (G). An upper bound for χ o (G)in terms of χ a (G) was given by Raspaud and Sopena. We also give an upper bound for χ o (G) in terms of the maximum degree of G. We shall show that this upper bound is not far from being optimal.
Who reads Acyclic and Oriented Chromatic Numbers of Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- A. V. Kostochka; E. Sopena; X. Zhu
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 1997
- Language
- EN
- Field
- Computer Science (Physical Sciences)