Pages that link to "Item:Q1132899"
From MaRDI portal
The following pages link to A characterization of Robert's inequality for boxicity (Q1132899):
Displaying 19 items.
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\) (Q722353) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- On the cubicity of bipartite graphs (Q987780) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- Irrepresentability by multiple intersection, or why the interval number is unbounded (Q1065021) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Stacks and splits of partially ordered sets (Q1160199) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Intersection properties of boxes. II: Extremal families (Q1182651) (← links)
- Intersection dimensions of graph classes (Q1334942) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- On the boxicity of Kneser graphs and complements of line graphs (Q2689506) (← links)
- Bounds for the boxicity of Mycielski graphs (Q4634991) (← links)
- On the Computation of the Competition Number of a Graph (Q4750663) (← links)
- Better bounds for poset dimension and boxicity (Q5217895) (← links)
- Separability, boxicity, and partial orders (Q6139870) (← links)
