Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg v 2 n -1p(n) for every edge uv of G, where p(n) = 0 if n is even and p(n) = 1 if n is odd. Here it is shown that the bound n -1 -dn) can be decreased to (2n + 1)/3 if every bridge of G is incident wi
β¦ LIBER β¦
On pancyclic line graphs
β Scribed by Ronghua Shi
- Book ID
- 112666687
- Publisher
- Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 1987
- Tongue
- English
- Weight
- 552 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0168-9673
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On circuits and pancyclic line graphs
β
A. Benhocine; L. Clark; N. KΓΆhler; H. J. Veldman
π
Article
π
1986
π
John Wiley and Sons
π
English
β 649 KB
Pancyclic and panconnected line graphs
β
Abdelhamid Benhocine; Jean-Luc Fouquet
π
Article
π
1987
π
John Wiley and Sons
π
English
β 716 KB
Let G be a graph of order n 2 3. We prove that if G is k-connected ( k 2 2) and the degree sum of k + 1 mutually independent vertices of G is We also prove that if G is such that the degree sum of every 2 adjacent vertices is at least n , then L ( G ) is panconnected with some exceptions.
Pancyclicity of hamiltonian line graphs
β
E. van Blanken; J. van den Heuvel; H.J. Veldman
π
Article
π
1995
π
Elsevier Science
π
English
β 251 KB
The ChvΓ‘tal-ErdΓΆs condition and pancycli
β
Abdelhamid Benhocine; Jean-Luc Fouquet
π
Article
π
1987
π
Elsevier Science
π
English
β 422 KB
Pancyclic graphs I
β
J.A Bondy
π
Article
π
1971
π
Elsevier Science
π
English
β 216 KB
Pancyclic graphs II
β
J.A Bondy; A.W Ingleton
π
Article
π
1976
π
Elsevier Science
π
English
β 293 KB