Hamiltonian cycle is polynomial on cocomparability graphs
نویسندگان
چکیده
منابع مشابه
Weighted Independent Perfect Domination on Cocomparability Graphs
*Supported partly by the National Science Council of the Republic of China under grant NSC82-0208-M009-050. IDIMACS permanent member. lCurrent address: Laboratory for Computer Science, MIT, Cambridge, MA 02139. Emaih [email protected].
متن کاملHamiltonian Cycle Problem on Distance-Hereditary Graphs
All graphs considered in this paper are finite and undirected, without loops or multiple edges. Let G = (V, E) be a graph. Throughout this paper, let m and n denote the numbers of edges and vertices of graph G, respectively. A connected graph is distance-hereditary if the distance between every two vertices in a connected induced subgraph is the same as that in the original graph. Distance-here...
متن کامل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 ⌈
متن کاملLinear Time LexDFS on Cocomparability Graphs
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs, a subfamily of perfect graphs. Cocomparability graphs have been well studied through their complements (comparability graphs) and their corresponding posets. Recently however LexDFS has led to a number of elegant near linear time algorithms on cocomparab...
متن کاملA Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
Given a graph G, the longest path problem asks to compute a simple path of G with the largest number of vertices. This problem is the most natural optimization version of the well-known and well-studied Hamiltonian path problem, and thus it is NP-hard on general graphs. However, in contrast to the Hamiltonian path problem, there are only a few restricted graph families, such as trees, and some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90168-a