|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2005, Volume 2, Pages 222–229
(Mi semr27)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Research papers
An oriented $7$-colouring of planar graphs with girth at least $7$
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 digraph $H$ is an oriented homomorphism of $H$ into a $k$-vertex tournament. We prove that every orientation of a plane graph with girth at least $7$ has an oriented $7$-colouring.
Received October 4, 2005, published November 3, 2005
Citation:
O. V. Borodin, A. O. Ivanova, “An oriented $7$-colouring of planar graphs with girth at least $7$”, Sib. Èlektron. Mat. Izv., 2 (2005), 222–229
Linking options:
https://www.mathnet.ru/eng/semr27 https://www.mathnet.ru/eng/semr/v2/p222
|
Statistics & downloads: |
Abstract page: | 347 | Full-text PDF : | 66 | References: | 64 |
|