A characterization of Robert's inequality for boxicity
From MaRDI portal
Publication:1132899
Cites work
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
- On double and multiple interval graphs
- Representation of a finite graph by a set of intervals on the real line
- The circular dimension of a graph
Cited in
(21)- Cubicity, boxicity, and vertex cover
- Irrepresentability by multiple intersection, or why the interval number is unbounded
- On dimensional properties of graphs
- Stacks and splits of partially ordered sets
- Representations of graphs and networks (coding, layouts and embeddings)
- Intersection properties of boxes. II: Extremal families
- Intersection dimensions of graph classes
- Towards a comprehensive theory of conflict-tolerance graphs
- Lower bounds for boxicity
- On the boxicity of Kneser graphs and complements of line graphs
- Bounds for the boxicity of Mycielski graphs
- On the Computation of the Competition Number of a Graph
- Better bounds for poset dimension and boxicity
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Separability, boxicity, and partial orders
- Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups
- Grid intersection graphs and boxicity
- A survey on the boxicity and cubicity of graphs
- A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\)
- A constant factor approximation algorithm for boxicity of circular arc graphs
- On the cubicity of bipartite graphs
This page was built for publication: A characterization of Robert's inequality for boxicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132899)
