Grid intersection graphs and boxicity
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.
scientific article; zbMATH DE number 423563