Hamiltonian circuits in interval graph generalizations (Q1092669): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90135-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028363955 / rank | |||
Normal rank | |||
Revision as of 20:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian circuits in interval graph generalizations |
scientific article |
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
