@inproceedings{c87f7c851ce94945b780031f735395d6,

title = "Intersection Dimension of Bipartite Graphs",

abstract = "We introduce a concept of intersection dimension of a graph with respect to a graph class. This generalizes ferrers dimension, boxicity, and poset dimension, and leads to interesting new problems. We focus in particular on bipartite graph classes defined as intersection graphs of two kinds of geometric objects. We relate well-known graph classes such as interval bigraphs, two-directional orthogonal ray graphs, chain graphs, and (unit) grid intersection graphs with respect to these dimensions. As an application of these graph-theoretic results, we show that the recognition problems for certain graph classes are np-complete.keywordsferrers dimensionboxicityunit grid intersection graphsegment-ray graphsorthogonal ray graphnp-hardness.",

author = "Steven Chaplick and Pavol Hell and Yota Otachi and Toshiki Saitoh and Ryuhei Uehara",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2014",

doi = "10.1007/978-3-319-06089-7_23",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature Switzerland AG",

pages = "323--340",

editor = "T.V. Gopal and M. Agrawal and A. Lia and S.B. Cooper",

booktitle = "Theory and Applications of Models of Computation. TAMC 2014",

}