The following pages link to Boxicity and treewidth (Q2642011):
Displaying 25 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Product dimension of forests and bounded treewidth graphs (Q396879) (← links)
- Boxicity of line graphs (Q409342) (← links)
- Boxicity and topological invariants (Q499501) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Boxicity of circular arc graphs (Q659754) (← 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 stab number of rectangle intersection graphs (Q778517) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- The cubicity of hypercube graphs (Q998463) (← links)
- Boxicity of graphs with bounded degree (Q1024326) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Intersection dimension and graph invariants (Q2214313) (← links)
- Better bounds for poset dimension and boxicity (Q5217895) (← links)
