Title of article
On the maximum average degree and the oriented chromatic number of a graph Original Research Article
Author/Authors
O.V. Borodin، نويسنده , , A.V. Kostochka، نويسنده , , J. Ne?et?il، نويسنده , , A. Raspaud، نويسنده , , E. Sopena، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
13
From page
77
To page
89
Abstract
The oriented chromatic number o(H) of an oriented graph H is defined as the minimum order of an oriented graph H′ such that H has a homomorphism to H′. The oriented chromatic number o(G) of an undirected graph G is then defined as the maximum oriented chromatic number of its orientations. In this paper we study the links between o(G) and mad(G) defined as the maximum average degree of the subgraphs of G.
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950921
Link To Document