Ferrers dimension of grid intersection graphs
From MaRDI portal
Publication:344841
DOI10.1016/J.DAM.2015.05.035zbMATH Open1350.05142OpenAlexW650364680MaRDI QIDQ344841FDOQ344841
Ryuhei Uehara, Steven Chaplick, Pavol Hell, Toshiki Saitoh, Yota Otachi
Publication date: 24 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.035
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- Efficient graph representations
- Bipartite permutation graphs
- On orthogonal ray graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Boxicity and Poset Dimension
- Dimension of the crown \(S^k_n\)
- Cubicity, boxicity, and vertex cover
- On dimensional properties of graphs
- On the Ferrers dimension of a digraph
- On grid intersection graphs
- Intersection dimensions of graph classes
- Permuting matrices to avoid forbidden submatrices
- Representing digraphs using intervals or circular arcs
- List homomorphisms and circular arc graphs
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Approximation of Minimum Cost Homomorphisms
- Permutation bigraphs and interval containments
- Interval bigraphs and circular arc graphs
- Two remarks on circular arc graphs
- Grid intersection graphs and boxicity
Cited In (4)
This page was built for publication: Ferrers dimension of grid intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344841)
