Neighborhood Conditions and $k$-Factors
IIDA, Tadashi ; NISHIMURA, Tsuyoshi
Tokyo J. of Math., Tome 20 (1997) no. 2, p. 411-418 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Let $k$ be an integer such that $k\geq 2$, and let $G$ be a connected graph of order $n$ such that $n\geq 9k-1-4\sqrt{2(k-1)^2+2}$, $kn$ is even, and the minimum degree is at least $k$. We prove that if $|N_G(u)\cup N_G(v)|\geq\frac{1}{2}(n+k-2)$ for each pair of nonadjacent vertices $u$, $v$ of $G$, then $G$ has a $k$-factor.
Publié le : 1997-12-15
Classification:  
@article{1270042114,
     author = {IIDA, Tadashi and NISHIMURA, Tsuyoshi},
     title = {Neighborhood Conditions and $k$-Factors},
     journal = {Tokyo J. of Math.},
     volume = {20},
     number = {2},
     year = {1997},
     pages = { 411-418},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1270042114}
}

IIDA, Tadashi; NISHIMURA, Tsuyoshi. Neighborhood Conditions and $k$-Factors. Tokyo J. of Math., Tome 20 (1997) no. 2, pp.  411-418. http://gdmltest.u-ga.fr/item/1270042114/