|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 1, Pages 16–32
(Mi da21)
|
|
|
|
This article is cited in 25 scientific papers (total in 25 papers)
Oriented 5-coloring of sparse plane graphs
O. V. Borodina, A. O. Ivanovab, A. V. Kostochkaac a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Yakutsk State University
c University of Illinois at Urbana-Champaign
Abstract:
An oriented $k$-coloring of an oriented graph $H$ is defined to be an oriented homomorphism of $H$ into a $k$-vertex tournament. It is proved that every orientation of a graph with girth at least 5 and maximum average degree over all subgraphs less than 12/5 has an oriented 5-coloring. As a consequence, each orientation of a plane or projective plane graph with girth at least 12 has an oriented 5-coloring.
Received: 27.09.2005
Citation:
O. V. Borodin, A. O. Ivanova, A. V. Kostochka, “Oriented 5-coloring of sparse plane graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 16–32; J. Appl. Industr. Math., 1:1 (2007), 9–17
Linking options:
https://www.mathnet.ru/eng/da21 https://www.mathnet.ru/eng/da/v13/s1/i1/p16
|
Statistics & downloads: |
Abstract page: | 637 | Full-text PDF : | 132 | References: | 66 |
|