Hamiltonian circuits in interval graph generalizations (Q1092669)
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 circuits in interval graph generalizations |
scientific article; zbMATH DE number 4020493
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian circuits in interval graph generalizations |
scientific article; zbMATH DE number 4020493 |
Statements
Hamiltonian circuits in interval graph generalizations (English)
0 references
1986
0 references
We consider the problem of finding a Hamiltonian circuit in some classes of intersection graphs which generalize interval graphs. We show that the problem is NP-complete for undirected path graphs (and hence chordal graphs), double interval graphs, and rectangle graphs.
0 references
Hamiltonian circuit
0 references
intersection graphs
0 references
NP-complete
0 references
undirected path graphs
0 references
chordal graphs
0 references
double interval graphs
0 references
rectangle graphs
0 references
0 references
0.95089245
0 references
0.9226934
0 references
0.9113817
0 references
0.90793514
0 references
0.9059599
0 references
0.9007195
0 references
0.9000583
0 references
0.8995994
0 references
