Geodesic
On regular factors in regular graphs with small radius
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this note we examine the connection between vertices of high eccentricity and the existence of $k$-factors in regular graphs. This leads to new results in the case that the radius of the graph is small ($\leq 3$), namely that a $d$-regular graph $G$ has all $k$-factors, for $k|V(G)|$ even and $k\le d$, if it has at most $2d+2$ vertices of eccentricity $>3$. In particular, each regular graph $G$ of diameter $\leq3$ has every $k$-factor, for $k|V(G)|$ even and $k\le d$.
DOI : 10.37236/1760
Classification : 05C70, 05C35 
@article{10_37236_1760,
     author = {Arne Hoffmann and Lutz Volkmann},
     title = {On regular factors in regular graphs with small radius},
     journal = {The electronic journal of combinatorics},
     year = {2004},
     volume = {11},
     number = {1},
     doi = {10.37236/1760},
     zbl = {1043.05098},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1760/}
}
TY  - JOUR
AU  - Arne Hoffmann
AU  - Lutz Volkmann
TI  - On regular factors in regular graphs with small radius
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1760/
DO  - 10.37236/1760
ID  - 10_37236_1760
ER  - 
%0 Journal Article
%A Arne Hoffmann
%A Lutz Volkmann
%T On regular factors in regular graphs with small radius
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1760/
%R 10.37236/1760
%F 10_37236_1760
Arne Hoffmann; Lutz Volkmann. On regular factors in regular graphs with small radius. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1760

Cité par Sources :