arXiv Analytics

Sign in

arXiv:1112.0748 [math.CO]AbstractReferencesReviewsResources

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

Hongliang Lu, David G. L. Wang

Published 2011-12-04Version 1

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 {r\over2}-1$. This gives a negative answer to a problem posed by Akbari and Kano recently.

Categories: math.CO
Subjects: 05C75
Related articles: Most relevant | Search more
arXiv:2309.02993 [math.CO] (Published 2023-09-06)
Counting triangles in regular graphs
arXiv:0804.4681 [math.CO] (Published 2008-04-29)
$d$-Regular graphs of acyclic chromatic index at least $d+2$
arXiv:1101.5071 [math.CO] (Published 2011-01-26, updated 2011-04-22)
On bar lengths in partitions