|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2006, Volume 3, Pages 355–361
(Mi semr213)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Research papers
List $(p,q)$-coloring of sparse plane graphs
O. V. Borodina, A. O. Ivanovab, T. K. Neustroevab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Yakutsk State University
Abstract:
For plane graphs of large enough girth we prove an upper bound for the list $(p,q)$-chromatic number which differs from the best possible one by at most an additive term that does not depend on $p$.
Received October 3, 2006, published October 20, 2006
Citation:
O. V. Borodin, A. O. Ivanova, T. K. Neustroeva, “List $(p,q)$-coloring of sparse plane graphs”, Sib. Èlektron. Mat. Izv., 3 (2006), 355–361
Linking options:
https://www.mathnet.ru/eng/semr213 https://www.mathnet.ru/eng/semr/v3/p355
|
Statistics & downloads: |
Abstract page: | 349 | Full-text PDF : | 59 | References: | 49 |
|