Collapsible graphs and Hamiltonian connectedness of line graphs
نویسندگان
چکیده
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics— an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, World Scientific, Singapore/London, 1995, pp. 53–69, Conjecture 8.6] conjectured that every 3-edge connected, essentially 6-edge connected graph is collapsible. In this paper, we prove the following results. (1) Every 3-edge connected, essentially 6-edge connected graph with edge-degree at least 7 is collapsible. (2) Every 3-edge connected, essentially 5-edge connected graph with edge-degree at least 6 and at most 24 vertices of degree 3 is collapsible which implies that 5-connected line graph with minimum degree at least 6 of a graph with at most 24 vertices of degree 3 is Hamiltonian. (3) Every 3-connected, essentially 11-connected line graph is Hamilton-connected which strengthens the result in [H.-J. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Combin. Theory, Ser. B 96 (2006) 571–576] by Lai et al. (4) Every 7-connected line graph is Hamiltonian connected which is proved by a method different from Zhan’s. By using the multigraph closure introduced by Ryjáček and Vrána which turns a claw-free graph into the line graph of a multigraph while preserving its Hamiltonconnectedness, the results (3) and (4) can be extended to claw-free graphs. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Collapsible Graphs and Hamiltonicity of Line Graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53–69; Conjecture 8.6 of 1995) conjectured that every 3-edge connected and essentially 6-edge connected graph is collapsible. Denote D3(G) the set of vertices of degree 3 of graph G. For e = uv ∈ E(G), define d(e) = d(u)+ d(v)− 2 the edge ...
متن کاملThomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
A graph G is 1-Hamilton-connected if G − x is Hamilton-connected for every x ∈ V (G), and G is 2-edge-Hamilton-connected if the graph G + X has a hamiltonian cycle containing all edges of X for any X ⊂ E+(G) = {xy| x, y ∈ V (G)} with 1 ≤ |X| ≤ 2. We prove that Thomassen’s conjecture (every 4-connected line graph is hamiltonian, or, equivalently, every snark has a dominating cycle) is equivalent...
متن کاملHamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملCollapsible graphs and reductions of line graphs
A graph G is collapsible if for every even subset X ~ V(G), G has a subgraph r such that G E(J ') is connected and the set of odd-degree vertices of J' is X. A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G. In this paper. we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 160 شماره
صفحات -
تاریخ انتشار 2012