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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., Ser. 1, 2001, Volume 8, Number 4, Pages 34–53 (Mi da230)  

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

On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph

O. V. Borodin, A. N. Glebov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (1990 kB)

Bibliographic databases:
UDC: 519.172.2
Received: 26.06.2001

Citation: O. V. Borodin, A. N. Glebov, “On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001), 34–53

Citation in format AMSBIB
\Bibitem{BorGle01}
\by O.~V.~Borodin, A.~N.~Glebov
\paper On the partition of a~planar graph of girth~5 into an empty and an acyclic subgraph
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2001
\vol 8
\issue 4
\pages 34--53
\mathnet{http://mi.mathnet.ru/da230}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1918259}
\zmath{https://zbmath.org/?q=an:1012.05133}


Linking options:
  • http://mi.mathnet.ru/eng/da230
  • http://mi.mathnet.ru/eng/da/v8/s1/i4/p34

    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. Salavatipour M.R., “Large induced forests in triangle-free planar graphs”, Graphs and Combinatorics, 22:1 (2006), 113–126  crossref  mathscinet  zmath  isi  scopus
    2. Raspaud A., Wang W., “On the vertex-arboricity of planar”, European J Combin, 29:4 (2008), 1064–1075  crossref  mathscinet  zmath  isi  scopus
    3. D. Zh. Zambalaeva, “Razbienie ploskogo grafa s obkhvatom 7 na dva zvezdnykh lesa”, Diskretn. analiz i issled. oper., 16:3 (2009), 20–46  mathnet  mathscinet  zmath
    4. Kawarabayashi K.-i., Thomassen C., “Decomposing a planar graph of girth 5 into an independent set and a forest”, Journal of Combinatorial Theory Series B, 99:4 (2009), 674–684  crossref  mathscinet  zmath  isi  scopus
    5. Borodin O.V., Glebov A.N., Raspaud A., “Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable”, Discrete Math, 310:20 (2010), 2584–2594  crossref  mathscinet  zmath  isi  elib  scopus
    6. Borodin O.V., Glebov A.N., “Planar Graphs with Neither 5-Cycles Nor Close 3-Cycles Are 3-Colorable”, J Graph Theory, 66:1 (2011), 1–31  crossref  mathscinet  zmath  isi  elib  scopus
    7. Borodin O.V. Glebov A.N. Jensen T.R., “A Step Towards the Strong Version of Havel's Three Color Conjecture”, J. Comb. Theory Ser. B, 102:6 (2012), 1295–1320  crossref  mathscinet  zmath  isi  elib  scopus
    8. Havet F., King A.D., Liedloff M., Todinca L., “(Circular) Backbone Colouring: Forest Backbones in Planar Graphs”, Discrete Appl. Math., 169 (2014), 119–134  crossref  mathscinet  zmath  isi  elib  scopus
    9. Lukot'ka R., Mazak J., Zhu X., “Maximum 4-Degenerate Subgraph of a Planar Graph”, Electron. J. Comb., 22:1 (2015), P1.11  mathscinet  isi
    10. Macajova E., Raspaud A., Skoviera M., “the Chromatic Number of a Signed Graph”, Electron. J. Comb., 23:1 (2016), P1.14  mathscinet  zmath  isi
    11. Dross F., Montassier M., Pinlou A., “Partitioning a Triangle-Free Planar Graph Into a Forest and a Forest of Bounded Degree”, Eur. J. Comb., 66 (2017), 81–94  crossref  mathscinet  zmath  isi  scopus
    12. Dross F., Montassier M., Pinlou A., “Partitioning Sparse Graphs Into An Independent Set and a Forest of Bounded Degree”, Electron. J. Comb., 25:1 (2018), P1.45  mathscinet  zmath  isi
  • Дискретный анализ и исследование операций
    Number of views:
    This page:317
    Full text:118

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