Name
Abstract | ||
|---|---|---|
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α , then G contains a cycle of length at least min {n,3δ−3,n+δ−α} . |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00331-3 | Discrete Mathematics |
Keywords | Field | DocType |
05c35,long cycle,: graph,05c38,graph,hamilton cycle,05c45,3-cyclable,3-cyclable graph,maximum independent set | Discrete mathematics,Graph toughness,Combinatorics,Cycle basis,Cycle graph,Independent set,Degree (graph theory),Frequency partition of a graph,Mathematics,Maximal independent set,Path graph | Journal |
Volume | Issue | ISSN |
218 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Bauer | 1 | 204 | 38.81 |
| L. McGuire | 2 | 0 | 0.34 |
| H. Trommel | 3 | 11 | 1.77 |
| H. J. Veldman | 4 | 262 | 44.44 |