O. V. Borodin, A. O. Ivanova, T. K. Neustroeva, “List <nobr>$(p,q)$</nobr>-coloring of sparse plane graphs”, Sib. Èlektron. Mat. Izv., 2006, Volume 3,Pages <nobr>355

This article is cited in 5 papers

Research papers

List $(p,q)$-coloring of sparse plane graphs

O. V. Borodin^a, A. O. Ivanova^b, T. K. Neustroeva^b

^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$.

UDC: 519.172.2

MSC: 05C15

Received October 3, 2006, published October 20, 2006