RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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., 2008, Volume 5, Pages 75–79 (Mi semr93)  

This article is cited in 4 scientific papers (total in 4 papers)

Research papers

Planar graphs without triangular $4$-cycles are $3$-choosable

O. V. Borodina, A. O. Ivanovab

a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Yakutsk State University

Abstract: It is known that not all planar graphs are $4$-choosable (Margit Voigt, 1993), but those without $4$-cycles are $4$-choosable (Lam, Xu and Liu, 1999). We prove that all planar graphs without $4$-cycles adjacent to $3$-cycles are $4$-choosable.

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

Bibliographic databases:

Document Type: Article
UDC: 519.172.2
MSC: 05C15
Received February 27, 2008, published March 24, 2008
Language: English

Citation: O. V. Borodin, A. O. Ivanova, “Planar graphs without triangular $4$-cycles are $3$-choosable”, Sib. Èlektron. Mat. Izv., 5 (2008), 75–79

Citation in format AMSBIB
\Bibitem{BorIva08}
\by O.~V.~Borodin, A.~O.~Ivanova
\paper Planar graphs without triangular $4$-cycles are $3$-choosable
\jour Sib. \`Elektron. Mat. Izv.
\yr 2008
\vol 5
\pages 75--79
\mathnet{http://mi.mathnet.ru/semr93}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2586624}


Linking options:
  • http://mi.mathnet.ru/eng/semr93
  • http://mi.mathnet.ru/eng/semr/v5/p75

    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$-arboricity of planar graphs with no triangles at distance less than two”, Sib. elektron. matem. izv., 5 (2008), 211–214  mathnet  mathscinet
    2. Borodin O.V., Ivanova A.O., “Planar Graphs Without 4-Cycles Adjacent to 3-Cycles Are List Vertex 2-Arborable”, J Graph Theory, 62:3 (2009), 234–240  crossref  mathscinet  zmath  isi  elib
    3. Berikkyzy Zh., Cox Ch., Dairyko M., Hogenson K., Kumbhat M., Lidicky B., Messerschmidt K., Moss K., Nowak K., Palmowski K.F., Stolee D., “(4,2)-Choosability of Planar Graphs With Forbidden Structures”, Graphs Comb., 33:4 (2017), 751–787  crossref  mathscinet  zmath  isi  scopus
    4. Xu R., Wu J.-L., “A Sufficient Condition For a Planar Graph to Be 4-Choosable”, Discret Appl. Math., 224 (2017), 120–122  crossref  mathscinet  zmath  isi  scopus
  • Number of views:
    This page:218
    Full text:56
    References:20

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