Standard

Spanning trees with many leaves. / Karpov, D. V.

в: Journal of Mathematical Sciences, Том 179, № 5, 01.12.2011, стр. 616-620.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Karpov, DV 2011, 'Spanning trees with many leaves', Journal of Mathematical Sciences, Том. 179, № 5, стр. 616-620. https://doi.org/10.1007/s10958-011-0613-2

APA

Karpov, D. V. (2011). Spanning trees with many leaves. Journal of Mathematical Sciences, 179(5), 616-620. https://doi.org/10.1007/s10958-011-0613-2

Vancouver

Karpov DV. Spanning trees with many leaves. Journal of Mathematical Sciences. 2011 Дек. 1;179(5):616-620. https://doi.org/10.1007/s10958-011-0613-2

Author

Karpov, D. V. / Spanning trees with many leaves. в: Journal of Mathematical Sciences. 2011 ; Том 179, № 5. стр. 616-620.

BibTeX

@article{6a69ae8f75944b06b6a156926d3a99c9,
title = "Spanning trees with many leaves",
abstract = "Let a maximal chain of vertices of degree 2 in a graph G consist of k > 0 vertices. We prove that G has a spanning tree with more than ν(G)/2k+4 leaves (where ν(G) is the number of vertices of the graph G). We present an infinite series of examples showing that the constant 1/2k+4 cannot be enlarged. Bibliography: 7 titles.",
author = "Karpov, {D. V.}",
year = "2011",
month = dec,
day = "1",
doi = "10.1007/s10958-011-0613-2",
language = "English",
volume = "179",
pages = "616--620",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "5",

}

RIS

TY - JOUR

T1 - Spanning trees with many leaves

AU - Karpov, D. V.

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Let a maximal chain of vertices of degree 2 in a graph G consist of k > 0 vertices. We prove that G has a spanning tree with more than ν(G)/2k+4 leaves (where ν(G) is the number of vertices of the graph G). We present an infinite series of examples showing that the constant 1/2k+4 cannot be enlarged. Bibliography: 7 titles.

AB - Let a maximal chain of vertices of degree 2 in a graph G consist of k > 0 vertices. We prove that G has a spanning tree with more than ν(G)/2k+4 leaves (where ν(G) is the number of vertices of the graph G). We present an infinite series of examples showing that the constant 1/2k+4 cannot be enlarged. Bibliography: 7 titles.

UR - http://www.scopus.com/inward/record.url?scp=83055186786&partnerID=8YFLogxK

U2 - 10.1007/s10958-011-0613-2

DO - 10.1007/s10958-011-0613-2

M3 - Article

AN - SCOPUS:83055186786

VL - 179

SP - 616

EP - 620

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 5

ER -

ID: 36925960