Abstract
We show that, every oriented graph with maximum average degree less than 28/9 admits a homomorphism into the Paley tournament with 11 vertices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Borodin, O.V., Kostochka, A.V., Nešetřil, J., Raspaud, A., Sopena, E.: On the maximum average degree and the oriented chromatic number of a graph. Discrete Math. 206, 77–90 (1999)
Fertin, G., Raspaud, A., Roychowdhury, A.: On the oriented chromatic number of grids. Inf. Proc. Lett. 85, 261–266 (2003)
Marshall, T. H.: On oriented graphs with certain extension properties. Ars Combin. (To appear)
Pinlou, A.: An oriented coloring of planar graphs with girth at least five. Discrete Math. 309, 2108–2118 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Marshall, T.H. \(P_{11}\)-Coloring of Oriented Graphs. Graphs and Combinatorics 32, 2029–2045 (2016). https://doi.org/10.1007/s00373-016-1703-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1703-1