摘要
An even factor of a graph G is a spanning subgraph in G such that the degree of each vertex is a positive even integer. In this paper, we show that for any induced claw of simple graph G of order at least 10, if there exists at least a pair of vertices out of the claw such that they are the common neighbors of nonadjacent vertices of the claw, then G has an even factor if and only if δ(G) ≥ 2 and every odd branch-bond of G contains a branch of length 1. The even factor of claw-heavy graphs was also characterized.
源语言 | 英语 |
---|---|
页(从-至) | 1529-1540 |
页数 | 12 |
期刊 | Bulletin of the Malaysian Mathematical Sciences Society |
卷 | 41 |
期 | 3 |
DOI | |
出版状态 | 已出版 - 1 7月 2018 |
指纹
探究 'Induced claws and existence of even factors of graphs' 的科研主题。它们共同构成独一无二的指纹。引用此
Lv, S., Xiong, L., Su, G., & Zhao, N. (2018). Induced claws and existence of even factors of graphs. Bulletin of the Malaysian Mathematical Sciences Society, 41(3), 1529-1540. https://doi.org/10.1007/s40840-016-0410-7