Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
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

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2007, Volume 4, Pages 296–299 (Mi semr159)  
This article is cited in 3 scientific papers (total in 3 papers)

Research papers

Decomposing a planar graph into a forest and a subgraph of restricted maximum degree

O. V. Borodina, A. O. Ivanovab, B. S. Stechkinc

a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Yakutsk State University
c Steklov's Institute of Mathematics, Moscow, Russia
Full-text PDF (647 kB) Citations (3)
References:
PDF
HTML
Abstract: We disprove the conjecture of He, Hou, Lih, Shao, Wang and Zhu that every plane graph $G$ can be edge-partitioned into a forest and a subgraph of the maximum degree at most $\lceil\Delta(G)/2\rceil+1$.
Received June 16, 2007, published June 29, 2007
Bibliographic databases:
Document Type: Article
UDC: 519.172.2
MSC: 05C15
Language: English
Citation: O. V. Borodin, A. O. Ivanova, B. S. Stechkin, “Decomposing a planar graph into a forest and a subgraph of restricted maximum degree”, Sib. Èlektron. Mat. Izv., 4 (2007), 296–299
Citation in format AMSBIB
\Bibitem{BorIvaSte07}
\by O.~V.~Borodin, A.~O.~Ivanova, B.~S.~Stechkin
\paper Decomposing a~planar graph into a~forest and a~subgraph of restricted maximum degree
\jour Sib. \`Elektron. Mat. Izv.
\yr 2007
\vol 4
\pages 296--299
\mathnet{http://mi.mathnet.ru/semr159}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2465429}
\zmath{https://zbmath.org/?q=an:1132.05313}
Linking options:
  • https://www.mathnet.ru/eng/semr159
  • https://www.mathnet.ru/eng/semr/v4/p296
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:278
    Full-text PDF :74
    References:54
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024