Name
Abstract | ||
|---|---|---|
Let f ( n ) be the smallest integer such that for every graph G of order n with minimum degree δ ( G ) > f ( n ), the line graph L ( G ) of G is pancyclic whenever L ( G ) is hamiltonian. Results are proved showing that f(n) = Θ(n 1 3 ) . |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0012-365X(94)00220-D | Discrete Mathematics |
Keywords | Field | DocType |
line graph,hamiltonian line graph,pancyclic graph,hamiltonian graph | Discrete mathematics,Combinatorics,Vertex-transitive graph,Edge-transitive graph,Graph power,Cubic graph,Quartic graph,Factor-critical graph,Symmetric graph,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
138 | 1 | Discrete Mathematics |
Citations | PageRank | References |
9 | 1.20 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| E. van Blanken | 1 | 9 | 1.20 |
| J. van den Heuvel | 2 | 9 | 1.53 |
| H. J. Veldman | 3 | 262 | 44.44 |