Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(83)90077-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971431042 / rank | |||
Normal rank | |||
Latest revision as of 10:56, 30 July 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
