Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1529-1540 |
Number of pages | 12 |
Journal | Bulletin of the Malaysian Mathematical Sciences Society |
Volume | 41 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Jul 2018 |
Keywords
- Branch-bond
- Claw-heavy graph
- Even factor
- Even subgraph
- Induced claw