On connected factors inK 1,3-free graphs |
| |
| Authors: | Li Guojun Giu Zhenhong |
| |
| Affiliation: | (1) Department of Mathematics, Shandong University, 250100 Jinan, China;(2) Institute of Systems Science, The Chinese Academy of Sciences, 100080 Beijing, China |
| |
| Abstract: | ![]()
A graph is said to beK 1,3-free if it contains noK 1,3 as an induced subgraph. It is shown in this paper that every 2-connectedK 1,3-free graph contains a connected [2,3]-factor. We also obtain that every connectedK 1,3-free graph has a spanning tree with maximum degree at most 3. This research is partially supported by the National Natural Sciences Foundation of China and by the Natural Sciences Foundation of Shandong Province of China. |
| |
| Keywords: | K 1,3-free graph connected [2,3]-factor |
| 本文献已被 SpringerLink 等数据库收录！ |
|
