On the ｛P_2,P_3｝-Factor of Cubic Graphs

作     者：缑葵香 孙良 

作者机构：School of Science Beijing Institute of Technology Beijing100081 China 

出 版 物：《Journal of Beijing Institute of Technology》 (北京理工大学学报（英文版）)

年 卷 期：2005年第14卷第4期

页      面：445-448页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：cubic graph path-factor path covering 

摘      要：Ler G = （ V, E） be a finite simple graph and Pn denote the path of order n. A spanning subgraph F is called a { P2, P3 }-factor of G if each component of F is isomorphic to P2 or P3. With the path-covering method, it is proved that any connected cubic graph with at least 5 vertices has a { P2, P3 }-factor F such that｜P3（F）｜P2（F）｜, where P2（F） and P3（F） denote the set of components of P2 and P3 in F, respectively.