|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2005, Volume 2, Pages 239–249
(Mi semr30)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Research papers
An oriented colouring of planar graphs with girth at least $4$
O. V. Borodina, A. O. Ivanovab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Yakutsk State University
Abstract:
An oriented $k$-colouring of an oriented graph $H$ is a homomorphism of $H$ into a tournament on $k$
vertices. In the paper we prove that any orientation of a planar graph without triangle has an oriented
$47$-colouring, which improves the best known upper bound $59$.
Received October 4, 2005, published November 4, 2005
Citation:
O. V. Borodin, A. O. Ivanova, “An oriented colouring of planar graphs with girth at least $4$”, Sib. Èlektron. Mat. Izv., 2 (2005), 239–249
Linking options:
https://www.mathnet.ru/eng/semr30 https://www.mathnet.ru/eng/semr/v2/p239
|
|