Zapiski Nauchnykh Seminarov POMI
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


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov POMI, 2010, Volume 381, Pages 31–46 (Mi znsl3851)  
This article is cited in 6 scientific papers (total in 6 papers)

Construction of a spanning tree with many leaves

N. V. Gravinab

a St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences, St. Petersburg, Russia
b Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore
Full-text PDF (1302 kB) Citations (6)
References:
PDF
HTML
Abstract: It is well known [4] that any $n$ vertex graph of minimal degree 4 possess a spanning tree with at least $\frac25\cdot n$ vertices, which is asymptotically sharp bound. In current work we present a polynomial algorithm that finds in a graph with $k$ vertices of degree at least four and $k'$ vertices of degree 3 a spanning tree with the number of leaves at least $\lceil\frac25\cdot k+\frac2{15}\cdot k'\rceil$. Bibl. 13 titles.
Key words and phrases: spanning tree, leaves, terminal vertices.
Received: 12.05.2010
English version:
Journal of Mathematical Sciences (New York), 2011, Volume 179, Issue 5, Pages 592–600
DOI: https://doi.org/10.1007/s10958-011-0611-4
Bibliographic databases:
Document Type: Article
UDC: 519.172.1
Language: Russian
Citation: N. V. Gravin, “Construction of a spanning tree with many leaves”, Combinatorics and graph theory. Part II, Zap. Nauchn. Sem. POMI, 381, POMI, St. Petersburg, 2010, 31–46; J. Math. Sci. (N. Y.), 179:5 (2011), 592–600
Citation in format AMSBIB
\Bibitem{Gra10}
\by N.~V.~Gravin
\paper Construction of a~spanning tree with many leaves
\inbook Combinatorics and graph theory. Part~II
\serial Zap. Nauchn. Sem. POMI
\yr 2010
\vol 381
\pages 31--46
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl3851}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2011
\vol 179
\issue 5
\pages 592--600
\crossref{https://doi.org/10.1007/s10958-011-0611-4}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-83055179298}
Linking options:
  • https://www.mathnet.ru/eng/znsl3851
  • https://www.mathnet.ru/eng/znsl/v381/p31
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:321
    Full-text PDF :80
    References:40
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024