The following pages link to (Q5588433):
Displaying 50 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Thin strip graphs (Q344860) (← links)
- Boxicity of line graphs (Q409342) (← links)
- Boxicity and topological invariants (Q499501) (← links)
- Box representations of embedded graphs (Q527439) (← links)
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Space graphs and sphericity (Q595671) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- The coordinate representation of a graph and \(n\)-universal graph of radius 1 (Q687112) (← links)
- Covering boxes by points (Q687139) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- Ferrers dimension and boxicity (Q708404) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- On the sphericity and cubicity of graphs (Q789416) (← links)
- Interval line graphs (Q795846) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- The micro-world of cographs (Q831855) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Upper bound on cubicity in terms of boxicity for graphs of low chromatic number (Q898085) (← links)
- A note on the m-center problem with rectilinear distances (Q913636) (← 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)
- On the cubicity of bipartite graphs (Q987780) (← links)
- The cubicity of hypercube graphs (Q998463) (← links)
- Boxicity of graphs with bounded degree (Q1024326) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- A characterization of competition graphs (Q1055443) (← links)
- A characterization of competition graphs of arbitrary digraphs (Q1055445) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- Irrepresentability by multiple intersection, or why the interval number is unbounded (Q1065021) (← links)
- On the sphericity of the graphs of semiregular polyhedra (Q1076032) (← links)
- Sphericity exceeds cubicity for almost all complete bipartite graphs (Q1077426) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- Poset boxicity of graphs (Q1103652) (← links)
- Intersection properties of boxes. I: An upper-bound theorem (Q1107826) (← links)
- Intersection graphs for families of balls in \(R^n\) (Q1112070) (← links)
