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., 2014, Volume 21, Number 2, Pages 33–51 (Mi da765)  

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

A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4

A. N. Glebovab, D. Zh. Zambalaevaa

a S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: We prove that every planar graph with girth at least 6 has a vertex partition into two forests containing no path of length greater than 4. Ill. 7, bibliogr. 9.

Keywords: planar graph, girth, path partition.

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

English version:
Journal of Applied and Industrial Mathematics, 2014, 8:3, 317–328

Bibliographic databases:

UDC: 519.8
Received: 25.12.2012
Revised: 21.11.2013

Citation: A. N. Glebov, D. Zh. Zambalaeva, “A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4”, Diskretn. Anal. Issled. Oper., 21:2 (2014), 33–51; J. Appl. Industr. Math., 8:3 (2014), 317–328

Citation in format AMSBIB
\Bibitem{GleZam14}
\by A.~N.~Glebov, D.~Zh.~Zambalaeva
\paper A partition of a~planar graph with girth~6 into two forests containing no path of length greater than~4
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 2
\pages 33--51
\mathnet{http://mi.mathnet.ru/da765}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3241786}
\transl
\jour J. Appl. Industr. Math.
\yr 2014
\vol 8
\issue 3
\pages 317--328
\crossref{https://doi.org/10.1134/S199047891403003X}


Linking options:
  • http://mi.mathnet.ru/eng/da765
  • http://mi.mathnet.ru/eng/da/v21/i2/p33

    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. M. Axenovich, T. Ueckerdt, P. Weiner, “Splitting planar graphs of girth 6 into two linear forests with short paths”, J. Graph Theory, 85:3 (2017), 601–618  crossref  mathscinet  zmath  isi  scopus
    2. A. N. Glebov, D. Zh. Zambalaeva, “Putevaya razbivaemost planarnykh grafov obkhvata 4 bez smezhnykh korotkikh tsiklov”, Sib. elektron. matem. izv., 15 (2018), 1040–1047  mathnet  crossref  mathscinet  zmath  isi
  • Дискретный анализ и исследование операций
    Number of views:
    This page:155
    Full text:42
    References:24
    First page:17

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