Pages that link to "Item:Q1025509"
From MaRDI portal
The following pages link to Cubicity, boxicity, and vertex cover (Q1025509):
Displaying 25 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Boxicity of line graphs (Q409342) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Upper bound on cubicity in terms of boxicity for graphs of low chromatic number (Q898085) (← 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)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- Covering with Euclidean boxes (Q1091402) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Local and union boxicity (Q1709530) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Boxicity and cubicity of product graphs (Q2346582) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- On the boxicity of Kneser graphs and complements of line graphs (Q2689506) (← links)
- (Q3136983) (← links)
- Bounds for the boxicity of Mycielski graphs (Q4634991) (← links)
- A note on lower bounds for boxicity of graphs (Q6571572) (← links)
- Contact graphs of boxes with unidirectional contacts (Q6599818) (← links)
