Title of article
Spanning trees with at most leaves in -free graphs
Author/Authors
Kyaw، نويسنده , , Aung، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
8
From page
2135
To page
2142
Abstract
We obtain a sufficient condition for K 1 , 4 -free graphs to have spanning trees with at most k leaves, as a generalization of the condition of Kyaw [A. Kyaw, Spanning trees with at most 3 leaves in K 1 , 4 -free graphs, Discrete Math. 309 (2009) 6146–6148] for K 1 , 4 -free graphs to have spanning trees with at most 3 leaves.
Keywords
spanning tree , Leaf , Degree sum , K 1 , 4 -free , Spanning t -ended system
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599715
Link To Document