Geodesic
A short proof of a theorem of Kano and Yu on factors in regular graphs
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let $e$ be an edge of an $r$-regular graph $G$. If $G$ has a 1-factor containing $e$ and a 1-factor avoiding $e$, then $G$ has a $k$-factor containing $e$ and a $k$-factor avoiding $e$ for every $k\in\{1,2,\ldots,r-1\}$.
DOI : 10.37236/1011
Classification : 05C70 
@article{10_37236_1011,
     author = {Lutz Volkmann},
     title = {A short proof of a theorem of {Kano} and {Yu} on factors in regular graphs},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1011},
     zbl = {1120.05073},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1011/}
}
TY  - JOUR
AU  - Lutz Volkmann
TI  - A short proof of a theorem of Kano and Yu on factors in regular graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1011/
DO  - 10.37236/1011
ID  - 10_37236_1011
ER  - 
%0 Journal Article
%A Lutz Volkmann
%T A short proof of a theorem of Kano and Yu on factors in regular graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1011/
%R 10.37236/1011
%F 10_37236_1011
Lutz Volkmann. A short proof of a theorem of Kano and Yu on factors in regular graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1011

Cité par Sources :