Hamiltonian Cycle Problem for Triangle Graphs
نویسنده
چکیده
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely related to inner-triangulated graphs. We present a linear-time heuristic algorithm that nds a solution at most one-third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics.
منابع مشابه
Hamiltonian Cycles in Triangle Graphs
We prove that the Hamiltonian cycle problem is NP complete for a class of planar graphs named triangle graphs that are closely related to inner triangulated graphs We present a linear time heuristic algorithm that nds a solution at most one third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics
متن کامل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.
متن کاملOn 3-regular 4-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability and posed the question of the existence of 3-regular 4-ordered (hamiltonian) graph...
متن کاملOn uniquely Hamiltonian claw-free and triangle-free graphs
A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian. We also show that this is best possible by exhibiting uniquely Hamiltonian claw-free graphs with minimum degree 2 and arbitrary maximum degree. Finally, we show that a construction due to Entringer and Swart can b...
متن کاملA note on Brooks' theorem for triangle-free graphs
For the class of triangle-free graphs Brooks’ Theorem can be restated in terms of forbidden induced subgraphs, i.e. let G be a triangle-free and K1,r+1-free graph. Then G is r-colourable unless G is isomorphic to an odd cycle or a complete graph with at most two vertices. In this note we present an improvement of Brooks’ Theorem for triangle-free and rsunshade-free graphs. Here, an r-sunshade (...
متن کامل