The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
نویسنده
چکیده
The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is O(n). Abstract. Hamiltonian Cycle, Z-mapping graph, complexity, decision, matching covered, optimization Hamiltonian Cycle, Z-mapping graph, complexity, decision, matching covered, optimization
منابع مشابه
Note on Petrie and Hamiltonian cycles in cubic polyhedral graphs
In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane graph is equivalent to the problem of the existence of an associated cubic plane multi-3-gonal graph with a Hamiltonian cycle which takes alternately left and right edges at each successive vertex, i.e. it is also a Petrie cycle. The Petrie Hamiltonian cycle in an n-vertex plane cubic graph can be recognize...
متن کاملHamiltonian properties of graphs with large neighborhood unions
Bauer, D., G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Mathematics 96 (1991) 33-49. Let G be a graph of order n, a k =min{~ki=ld(vi): {V 1 . . . . . Vn} is an independent set of vertices in G}, NC=min{IN(u) 13N(v) l :uv~E(G)} and NC2=min{IN(u) t3 N(v)l: d(u, v)=2}. O.~ proved that G is hamiltonian if o2~>n ~>3, while Faudree et al. proved t...
متن کاملAn Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
For MSO2-expressible problems like Edge Dominating Set or Hamiltonian Cycle, it was open for a long time whether there is an algorithm which given a clique-width k-expression of an n-vertex graph runs in time f(k) · nO(1) for some function f . Recently, Fomin et al. (SIAM. J. Computing, 2014) presented several lower bounds; for instance, there are no f(k) · n-time algorithms for Edge Dominating...
متن کاملThe Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
A Hamiltonian cycle (path) of a graph G is a simple cycle (path) which contains all the vertices of G. The Hamiltonian cycle problem asks whether a given graph contains a Hamiltonian cycle. It is NP-complete even for 3-connected planar graphs [3, 61. However, the problem becomes polynomial-time solvable for Cconnected planar graphs: Tutte proved that such a graph necessarily contains a Hamilton...
متن کامل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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0706.2725 شماره
صفحات -
تاریخ انتشار 2007