Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T). The subtree T − Leaf(T) of T is called the stem of T and denoted by Stem(T). In this paper, we give two sufficient condition...
Gorde:
| Egile nagusia: | |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
University of Zielona Góra
2016-08-01
|
| Saila: | Discussiones Mathematicae Graph Theory |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.7151/dmgt.1885 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|