Intersection Dimension of Bipartite Graphs

DOI10.1007/978-3-319-06089-7_23zbMath1406.05084OpenAlexW1520439278MaRDI QIDQ5410653

Ryuhei Uehara, Steven Chaplick, Toshiki Saitoh, Yota Otachi, Pavol Hell

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06089-7_23

zbMATH Keywords

NP-hardnessboxicityFerrers dimensionunit grid intersection graphorthogonal ray graphsegment-ray graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Proper colorability of segment intersection graphs ⋮ Recognition and drawing of stick graphs ⋮ Grid intersection graphs and order dimension

This page was built for publication: Intersection Dimension of Bipartite Graphs