A note on a spanning 3-tree

被引：6

作者：

Tsugaki, Masao ^{[1
]}

机构：

[1] Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, Tokyo 1628601, Japan

来源：

COMBINATORICA | 2009年 / 29卷 / 01期

关键词：

05C05;

D O I：

10.1007/s00493-009-2349-x

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 (na parts per thousand yen1,na parts per thousand yenma parts per thousand yen0), then G has a spanning 3-tree T with at most m vertices of degree 3.

引用

页码：127 / 129

页数：3