Chordal Bipartite Graphs with High Boxicity
- 98 Downloads
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.
KeywordsBoxicity Chordal bipartite graphs Interval graphs Grid intersection graphs
Unable to display preview. Download preview PDF.
- 6.Cozzens, M.B.: Higher and multidimensional analogues of interval graphs. PhD thesis, Rutgers University, New Brunswick (1981)Google Scholar
- 9.Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory 2 155–163 (1978)Google Scholar
- 13.Roberts, F.S.: The boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics, pp. 301–310. Academic Press, New York (1969)Google Scholar
- 14.Scheinerman, E.R.: Intersection classes and multiple intersection parameters. PhD thesis, Princeton University, Princeton (1984)Google Scholar