Recommendations
Cites work
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- A characterization of Robert's inequality for boxicity
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Irrepresentability by multiple intersection, or why the interval number is unbounded
- On grid intersection graphs
Cited in
(37)- Functionality of box intersection graphs
- String graphs of k-bend paths on a grid
- Boxicity of Halin graphs
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Chordal bipartite graphs with high boxicity
- The frame dimension and the complete overlap dimension of a graph
- Geometric representation of graphs in low dimension using axis parallel boxes
- scientific article; zbMATH DE number 5214885 (Why is no real title available?)
- Boxicity and cubicity of asteroidal triple free graphs
- The cubicity of hypercube graphs
- On the cubicity of bipartite graphs
- Grid intersection graphs and order dimension
- scientific article; zbMATH DE number 4023340 (Why is no real title available?)
- Lower bounds for boxicity
- Covering with Euclidean boxes
- A special planar satisfiability problem and a consequence of its NP- completeness
- An upper bound for cubicity in terms of boxicity
- Separability, boxicity, and partial orders
- Intersection dimension of bipartite graphs
- Simultaneous contact representations of planar graphs
- Optimal grid representations
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number
- A survey on the boxicity and cubicity of graphs
- scientific article; zbMATH DE number 1472165 (Why is no real title available?)
- Ferrers dimension of grid intersection graphs
- Extremal Results on Intersection Graphs of Boxes in $${\mathbb R}^d$$ R d
- On orthogonal ray trees
- The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
- On the cubicity of interval graphs
- On the boxicity of Kneser graphs and complements of line graphs
- On grid intersection graphs
- Boxicity and treewidth
- Intersection dimensions of graph classes
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- A constant factor approximation algorithm for boxicity of circular arc graphs
- On the cubicity of certain graphs
- Characterization of the graphs with boxicity \(\leq 2\)
This page was built for publication: Grid intersection graphs and boxicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685652)
