@article{26b7177d306341288d5f45d628056e1e,

title = "On the maximum average degree and the oriented chromatic number of a graph",

abstract = "The oriented chromatic number o(H) of an oriented graph H is denned 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.",

author = "Borodin, {O. V.} and Kostochka, {A. V.} and J. Ne{\v s}et{\v r}il and A. Raspaud and E. Sopena",

note = "Funding Information: ∗Corresponding author. E-mail: andre.raspaud@labri.u-bordeaux.fr. 1On leave of absence from the Institute of Mathematics, Novosibirsk, 630090, Russia. With support from Engineering and Physical Sciences Research Council, UK, grant GR=K00561, and from the International Science Foundation, grant NQ4000. 2This work was partially supported by the Network DIMANET of the European Union and by the grant 96-01-01614 of the Russian Foundation for Fundamental Research. 3A part of this research was supported by GACR and GAUK grants and done during a visit of LaBRI, Universite Bordeaux I (France).",

year = "1999",

month = aug,

day = "28",

doi = "10.1016/S0012-365X(98)00393-8",

language = "English (US)",

volume = "206",

pages = "77--89",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}