Pan-Factorial Property in Regular Graphs
Mikio Kanō, Qinglin Yu · The Electronic Journal of Combinatorics · 2005
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2005
Abstract
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$.
Open the resolved locator · 10.37236/1990
Metadata licence: OpenAlex metadata (CC0)