Path-Factors in the Square of a Tree |
| |
| Authors: | Xiaojuan?Li,Zhao?Zhang mailto:zhzhao@xju.edu.cn" title=" zhzhao@xju.edu.cn" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author |
| |
| Affiliation: | (1) College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, People’s Republic of China |
| |
| Abstract: | ![]()
In this paper, we give a necessary condition for the existence of P 3-factor in the square of a tree. Furthermore, we show that the square of any tree on at least 6 vertices has a {P 3,P 4}-factor. As a consequence, every connected graph on at least 6 vertices has a {P 3,P 4}-factor. Zhao Zhang: The research is supported by NSFC (60603003) and XJEDU. Received: November 15, 2006. Final version received: December 12, 2007. |
| |
| Keywords: | Path factor square graph |
| 本文献已被 SpringerLink 等数据库收录！ |
|
