Geodesic
Pan-factorial property in regular graphs
The electronic journal of combinatorics, Tome 12 (2005)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/1990
Classification : 05C70, 05C75 
@article{10_37236_1990,
     author = {M. Kano and Qinglin Yu},
     title = {Pan-factorial property in regular graphs},
     journal = {The electronic journal of combinatorics},
     year = {2005},
     volume = {12},
     doi = {10.37236/1990},
     zbl = {1079.05075},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1990/}
}
TY  - JOUR
AU  - M. Kano
AU  - Qinglin Yu
TI  - Pan-factorial property in regular graphs
JO  - The electronic journal of combinatorics
PY  - 2005
VL  - 12
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1990/
DO  - 10.37236/1990
ID  - 10_37236_1990
ER  - 
%0 Journal Article
%A M. Kano
%A Qinglin Yu
%T Pan-factorial property in regular graphs
%J The electronic journal of combinatorics
%D 2005
%V 12
%U http://geodesic.mathdoc.fr/articles/10.37236/1990/
%R 10.37236/1990
%F 10_37236_1990
M. Kano; Qinglin Yu. Pan-factorial property in regular graphs. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1990

Cité par Sources :