A Degree Condition for the Existence of $[a,b]$-Factors in $K_{1,n}$-Free Graphs
TOKUDA, Taro
Tokyo J. of Math., Tome 21 (1998) no. 2, p. 377-380 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
A graph is called $K_{1,n}$-free if it contains no $K_{1,n}$ as an induced subgraph. Let $a$, $b$ $(0\leq a
Publié le : 1998-12-15
Classification:  
@article{1270041821,
     author = {TOKUDA, Taro},
     title = {A Degree Condition for the Existence of $[a,b]$-Factors in $K\_{1,n}$-Free Graphs},
     journal = {Tokyo J. of Math.},
     volume = {21},
     number = {2},
     year = {1998},
     pages = { 377-380},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1270041821}
}

TOKUDA, Taro. A Degree Condition for the Existence of $[a,b]$-Factors in $K_{1,n}$-Free Graphs. Tokyo J. of Math., Tome 21 (1998) no. 2, pp.  377-380. http://gdmltest.u-ga.fr/item/1270041821/