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., 2009, Volume 16, Number 3, Pages 20–46 (Mi da572)  

This article is cited in 1 scientific paper (total in 1 paper)

Partition of a planar graph with girth 7 into two star forests

D. Zh. Zambalayeva

S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia

Abstract: We prove that the vertex set of any planar graph with girth at least 7 can be partitioned into two subsets such that each subset induces a star forest, i.e. a collection of vertex disjoint paths. Bibl. 26.

Keywords: planar graph, girth, path partition.

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

Bibliographic databases:
UDC: 519.172.2
Received: 11.12.2008
Revised: 24.02.2009

Citation: D. Zh. Zambalayeva, “Partition of a planar graph with girth 7 into two star forests”, Diskretn. Anal. Issled. Oper., 16:3 (2009), 20–46

Citation in format AMSBIB
\Bibitem{Zam09}
\by D.~Zh.~Zambalayeva
\paper Partition of a~planar graph with girth~7 into two star forests
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 3
\pages 20--46
\mathnet{http://mi.mathnet.ru/da572}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2588618}
\zmath{https://zbmath.org/?q=an:1249.05317}


Linking options:
  • http://mi.mathnet.ru/eng/da572
  • http://mi.mathnet.ru/eng/da/v16/i3/p20

    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. 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”, J. Appl. Industr. Math., 8:3 (2014), 317–328  mathnet  crossref  mathscinet
  • Дискретный анализ и исследование операций
    Number of views:
    This page:242
    Full text:70
    References:35
    First page:7

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