Geodesic
A $[k,k+1]$-Factor Containing A Given Hamiltonian Cycle
The electronic journal of combinatorics, Tome 6 (1999)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove the following best possible result. Let $k\ge 2$ be an integer and $G$ be a graph of order $n$ with minimum degree at least $k$. Assume $n \ge 8k-16$ for even $n$ and $n \ge 6k-13$ for odd $n$. If the degree sum of each pair of nonadjacent vertices of $G$ is at least $n$, then for any given Hamiltonian cycle $C$ of $G$, $G$ has a $[k,\,k+1]$-factor containing $C$. 
@article{10_37236_1436,
     author = {Cai Mao-cheng and Yanjun Li and Mikio Kano},
     title = {A $[k,k+1]${-Factor} {Containing} {A} {Given} {Hamiltonian} {Cycle}},
     journal = {The electronic journal of combinatorics},
     year = {1999},
     volume = {6},
     doi = {10.37236/1436},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1436/}
}
TY  - JOUR
AU  - Cai Mao-cheng
AU  - Yanjun Li
AU  - Mikio Kano
TI  - A $[k,k+1]$-Factor Containing A Given Hamiltonian Cycle
JO  - The electronic journal of combinatorics
PY  - 1999
VL  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1436/
DO  - 10.37236/1436
ID  - 10_37236_1436
ER  - 
%0 Journal Article
%A Cai Mao-cheng
%A Yanjun Li
%A Mikio Kano
%T A $[k,k+1]$-Factor Containing A Given Hamiltonian Cycle
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1436/
%R 10.37236/1436
%F 10_37236_1436
Cai Mao-cheng; Yanjun Li; Mikio Kano. A $[k,k+1]$-Factor Containing A Given Hamiltonian Cycle. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1436

Cité par Sources :