Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C99 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 3829974 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
intersection graph | |||
| Property / zbMATH Keywords: intersection graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
interval graph | |||
| Property / zbMATH Keywords: interval graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
boxicity | |||
| Property / zbMATH Keywords: boxicity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge coverings | |||
| Property / zbMATH Keywords: edge coverings / rank | |||
Normal rank | |||
Revision as of 18:44, 1 July 2023
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
