Name
Abstract | ||
|---|---|---|
Let G be a connected graph of order n and let k be a positive integer with kn even and n greater than or equal to 8k(2) + 12k + 6. We show that if delta(G) greater than or equal to k and max{d(u),d(v)} greater than or equal to n/2 for each pair of vertices u,v at distance two, then G has a k-factor. Thereby a conjecture of Nishimura is answered in the affirmative. |
Year | Venue | Field |
|---|---|---|
1997 | ARS COMBINATORIA | Discrete mathematics,Mathematics |
DocType | Volume | ISSN |
Journal | 46 | 0381-7032 |
Citations | PageRank | References |
2 | 0.50 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Niessen | 1 | 164 | 18.28 |