|
|||||
|
|
A note on a spanning 3-tree |
|
| Authors: | Masao Tsugaki |
| Institution: | (1) Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka Shinjuku-ku, Tokyo 162-8601, Japan |
| Abstract: | A tree T is called a k-tree, if the maximum degree of T is at most k. In this paper, we prove that if G is an n-connected graph with independence number at most n + m + 1 (n≥1,n≥m≥0), then G has a spanning 3-tree T with at most m vertices of degree 3. |
| Keywords: | Mathematics Subject Classification (2000)" target="_blank">Mathematics Subject Classification (2000) 05C05 |
| 本文献已被 SpringerLink 等数据库收录！ | |