A cycle structure theorem for hamiltonian graphs
نویسندگان
چکیده
منابع مشابه
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.
متن کاملCycle spectra of Hamiltonian graphs
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least √ 4 7(m − n) different lengths. The coefficient 4/7 cannot be increased above 1, since when m = n2/4 there are √ m − n + 1 cycle lengths in Kn/2,n/2. For general m and n there are examples having at most 2 ⌈
متن کاملA Note on the Song-Zhang Theorem For Hamiltonian Graphs
An independent set S of a graph G is said to be essential if S has a pair of vertices that are distance two apart in G. Essential independent sets are a useful idea and have been considered in a number of papers. In 1994, Song and Zhang considered independent sets S and proved that if for each independent set S of cardinality k + 1, one of the following condition holds: (i) there exist u 6= v ∈...
متن کاملA structure theorem for graphs with no cycle with a unique chord and its consequences
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with one side containing only nodes of degree two and induced subgraph of the famous Heawood or Petersen g...
متن کاملHamiltonian Spider Intersection Graphs Are Cycle Extendable
A cycle C of length k is extendable if there is a cycle C′ of length k+1 with V (C) ⊂ V (C′). A graph G = (V,E) of order n is cycle extendable when every cycle C of length k < n is extendable. A chordal graph is a spider intersection graph if it admits an intersection representation which consists of subtrees of a sub-divided star (or spider). In 1990, Hendry conjectured that all hamiltonian ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1988
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90058-5