Connected Factors and Spanning Trees in Graphs |
| |
| Authors: | Tokuda Taro Xu Baoguang Wang Jianfang |
| |
| Institution: | (1) Department of Information Sciences, College of Science and Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki-gun, Saitama 350-0394, Japan e-mail: tokuda@j.dendai.ac.jp, JP;(2) Institute of Policy and Management, Chinese Academy Sciences, Beijing 100080, China e-mail: xbg@mail.casipm.ac.cn, CN;(3) Institute of Applied Mathematics, Chinese Academy Sciences, Beijing 100080, China, CN |
| |
| Abstract: | Let G be a graph, and g, f, f′ be positive integer-valued functions defined on V(G). If an f′-factor of G is a spanning tree, we say that it is f′-tree. In this paper, it is shown that G contains a connected (g, f+f′−1)-factor if G has a (g, f)-factor and an f′-tree.
Received: October 30, 2000 Final version received: August 20, 2002 |
| |
| Keywords: | , ,Connected factor, Factor-tree, Spanning tree |
| 本文献已被 SpringerLink 等数据库收录！ |
|
