Name
Abstract | ||
|---|---|---|
This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g . The most general result gives a lower bound of ck g /8 . |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0012-365X(98)00324-0 | Discrete Mathematics |
Keywords | Field | DocType |
girth,cycle length,cycle lengths,minimum degree,predecessor,lower bound | Discrete mathematics,Graph,Combinatorics,Upper and lower bounds,Mathematics | Journal |
Volume | Issue | ISSN |
200 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.48 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Erdős | 1 | 108 | 18.81 |
| R. J. Faudree | 2 | 174 | 38.15 |
| C. C. Rousseau | 3 | 126 | 22.97 |
| R. H. Schelp | 4 | 609 | 112.27 |