A graph is said to be K1,3-free if it contains no K1,3 as an induced subgraph. It is shown in this paper that every 2-connected K1,3-free graph contains a connected [2,3]-factor. We also obtain that every connected K1...A graph is said to be K1,3-free if it contains no K1,3 as an induced subgraph. It is shown in this paper that every 2-connected K1,3-free graph contains a connected [2,3]-factor. We also obtain that every connected K1,3-free graph has a spanning tree with maximum degree at most 3.展开更多
文摘A graph is said to be K1,3-free if it contains no K1,3 as an induced subgraph. It is shown in this paper that every 2-connected K1,3-free graph contains a connected [2,3]-factor. We also obtain that every connected K1,3-free graph has a spanning tree with maximum degree at most 3.