Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamiltonian cycle is polynomial on cocomparability graphs |
scientific article; zbMATH DE number 97211
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian cycle is polynomial on cocomparability graphs |
scientific article; zbMATH DE number 97211 |
Statements
Hamiltonian cycle is polynomial on cocomparability graphs (English)
0 references
17 January 1993
0 references
This paper describes a polynomial time algorithm for finding a Hamiltonian cycle in a graph which is the complement of a comparability graph.
0 references
Hamilton path
0 references
cocomparability graphs
0 references
partial order
0 references
bump number
0 references
polynomial time algorithm
0 references
Hamiltonian cycle
0 references
