Hamiltonian path in permutation graphs (Q6971747)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8052656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian path in permutation graphs |
scientific article; zbMATH DE number 8052656 |
Statements
Hamiltonian path in permutation graphs (English)
0 references
13 June 2025
0 references
The Hamiltonian path problem is NP-complete for general graphs. The notion of a follow-up vertex in a permutation graph is introduced in this research, with respect to its Hasse diagram. A necessary and sufficient condition is justified for the existence of a Hamiltonian path in a permutation graph in terms of the existence of a follow-up vertex. Specifically, it is proved that a permutation graph has a Hamiltonian path if and only if it has a follow-up vertex in its lowest layer in the Hasse diagram. A number of improved algorithms are developed using the findings on follow-up vertices to find solutions to the Hamiltonian path problem in permutation graphs that run in \(n(\log (\log n)\) time.
0 references
permutation graph
0 references
co-comparability graph
0 references
Hamiltonian path
0 references
clique partitioning
0 references
bump number
0 references
NP-completeness
0 references
0 references
