Grid intersection graphs and boxicity (Q685652): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grid intersection graphs and boxicity |
scientific article |
Statements
Grid intersection graphs and boxicity (English)
0 references
24 October 1993
0 references
A graph has boxicity \(k\) if \(k\) is the smallest integer such that the graph can be presented as an intersection of parallelepipeds in \(k\)- dimensional space. The bipartite graphs are shown to have boxicity 2. Some inequalities for graphs in higher dimensions are proved.
0 references
grid intersection graphs
0 references
boxicity
0 references
bipartite graphs
0 references
