Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903016 | Discrete Mathematics | 2018 | 17 Pages |
Abstract
(iii) Let G be a connected simple triangle-free (or bipartite) graph on n vertices. If dG(u)+dG(v)â¥n8 for any u,vâV(G) with uvâE(G), then for sufficiently large n, either L(G) is hamiltonian-connected, or κ(L(G))â¤2, or L(G) is not hamiltonian-connected, κ(L(G))â¥3 and G is contractible to W8, the Wagner graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai,