The Existence of a Path-Factor without Small Odd Paths

Electronic Journal Of Combinatorics

Yoshimi Egawa¹ 

关键词: Path-factor;    Component-factor;    Matching;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A $\{P_{2},P_{5}\}$-factor of a graph is a spanning subgraph of the graph each of whose components is isomorphic to either $P_{2}$ or $P_{5}$, where $P_{n}$ denote the path of order $n$. In this paper, we show that if a graph $G$ satisfies $c_{1}(G-X)+\fr

【 授权许可】

Others