RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sib. Èlektron. Mat. Izv., 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$.

Full text: PDF file (669 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.172.2
MSC: 05C15
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

Citation in format AMSBIB
\Bibitem{BorIvaNeu06}
\by O.~V.~Borodin, A.~O.~Ivanova, T.~K.~Neustroeva
\paper List $(p,q)$-coloring of sparse plane graphs
\jour Sib. \`Elektron. Mat. Izv.
\yr 2006
\vol 3
\pages 355--361
\mathnet{http://mi.mathnet.ru/semr213}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2276031}
\zmath{https://zbmath.org/?q=an:1119.05038}


Linking options:
  • http://mi.mathnet.ru/eng/semr213
  • http://mi.mathnet.ru/eng/semr/v3/p355

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. O. V. Borodin, A. O. Ivanova, “List 2-distance $(\Delta+2)$-coloring of planar graphs with girth 6 and $\Delta\ge24$”, Siberian Math. J., 50:6 (2009), 958–964  mathnet  crossref  mathscinet  isi
    2. Borodin O.V., Ivanova A.O., “$2$-distance $(\Delta+2)$-coloring of planar graphs with girth six and $\Delta\ge 18$”, Discrete Math., 309:23-24 (2009), 6496–6502  crossref  mathscinet  zmath  isi  elib
    3. A. O. Ivanova, “Predpisannaya 2-distantsionnaya $(\Delta+1)$-raskraska ploskikh grafov s obkhvatom ne menee 7”, Diskretn. analiz i issled. oper., 17:5 (2010), 22–36  mathnet  mathscinet  zmath
    4. Zhu H. Hou L. Chen W. Lu X., “The l(P, Q)-Labelling of Planar Graphs Without 4-Cycles”, Discrete Appl. Math., 162 (2014), 355–363  crossref  mathscinet  zmath  isi  elib
    5. Bu Yu., Yan X., “List 2-Distance Coloring of Planar Graphs”, J. Comb. Optim., 30:4, SI (2015), 1180–1195  crossref  mathscinet  zmath  isi  elib
  • Number of views:
    This page:228
    Full text:36
    References:27

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020