Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228)
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: Computing the boxicity of a graph by covering its complement by cointerval graphs |
scientific article; zbMATH DE number 3829974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the boxicity of a graph by covering its complement by cointerval graphs |
scientific article; zbMATH DE number 3829974 |
Statements
Computing the boxicity of a graph by covering its complement by cointerval graphs (English)
0 references
1983
0 references
intersection graph
0 references
interval graph
0 references
boxicity
0 references
edge coverings
0 references
