Grid intersection graphs and boxicity (Q685652)
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: Grid intersection graphs and boxicity |
scientific article; zbMATH DE number 423563
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grid intersection graphs and boxicity |
scientific article; zbMATH DE number 423563 |
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
