Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2001, Volume 13, Issue 1, Pages 63–72
DOI: https://doi.org/10.4213/dm273 (Mi dm273) 		 
This article is cited in 1 scientific paper (total in 1 paper)

A spanning tree with a large number of pendant vertices

D. V. Karpov
Full-text PDF (1114 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm273
Abstract: We prove that for every connected graph $G(V,E)$ with no adjacent vertices of degree 2 there exists a spanning tree with more than $|V|/5$ end vertices. We describe a polynomial algorithm of constructing such a tree. The constant 1/5 cannot be improved.
Received: 25.05.2000
Revised: 05.02.2001
Bibliographic databases:
UDC: 519.1
Language: Russian
Citation: D. V. Karpov, “A spanning tree with a large number of pendant vertices”, Diskr. Mat., 13:1 (2001), 63–72; Discrete Math. Appl., 11:2 (2002), 163–171
Citation in format AMSBIB
\Bibitem{Kar01}
\by D.~V.~Karpov
\paper A spanning tree with a large number of pendant vertices
\jour Diskr. Mat.
\yr 2001
\vol 13
\issue 1
\pages 63--72
\mathnet{http://mi.mathnet.ru/dm273}
\crossref{https://doi.org/10.4213/dm273}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1846038}
\zmath{https://zbmath.org/?q=an:1048.05027}
\transl
\jour Discrete Math. Appl.
\yr 2002
\vol 11
\issue 2
\pages 163--171
Linking options:
  • https://www.mathnet.ru/eng/dm273
  • https://doi.org/10.4213/dm273
  • https://www.mathnet.ru/eng/dm/v13/i1/p63
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:565
    Full-text PDF :341
    References:56
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024