Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the boxicity of a graph by covering its complement by cointerval graphs |
scientific article |
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
