A Note on $\{k,n-k\}$-Factors of Regular Graphs

Abstract

Let $r$ be an odd integer, and $k$ an even integer. In this note, we present $r$-regular graphs which have no $\{k,r-k\}$-factors for all $1\le k\le \frac{r}{2}-1$. This gives a negative answer to a problem posed by Akbari and Kano recently.

References in corpus (1)

• Note on parity factors of regular graphs