Pan-Factorial Property in Regular Graphs
Among other results, we show that if for any given edge $e$ of an $r$-regular graph $G$ of even order, $G$ has a 1-factor containing $e$, then $G$ has a $k$-factor containing $e$ and another one avoiding $e$ for all $k$, $1 \leq k \leq r-1$.
1986 ◽
Vol 41
(2)
◽
pp. 193-210
◽
Keyword(s):
Keyword(s):
Keyword(s):
1966 ◽
Vol 18
◽
pp. 1091-1094
◽