The Total Interval Number of a Graph II: Trees and Complexity (Q4881297)
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 894071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Total Interval Number of a Graph II: Trees and Complexity |
scientific article; zbMATH DE number 894071 |
Statements
The Total Interval Number of a Graph II: Trees and Complexity (English)
0 references
29 July 1996
0 references
intersection graph
0 references
interval graphs
0 references
interval number
0 references
total interval number
0 references
multiple-interval representation
0 references
trails
0 references
NP-completeness
0 references
line graphs
0 references
linear-time algorithm
0 references
trees
0 references
characterization
0 references
Aigner-Andreae bound
0 references
extremal trees
0 references
0.9255606
0 references
0.9132486
0 references
0 references
0.9016546
0 references
0.9000591
0 references
0.89384675
0 references
0.89321446
0 references
