Pages that link to "Item:Q1025528"
From MaRDI portal
The following pages link to An upper bound for cubicity in terms of boxicity (Q1025528):
Displaying 18 items.
- Boxicity of line graphs (Q409342) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← 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)
- The cubicity of hypercube graphs (Q998463) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Boxicity and cubicity of product graphs (Q2346582) (← links)
- Boxicity of graphs on surfaces (Q2376090) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- Cubicity of interval graphs and the claw number (Q2851505) (← links)
- Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions (Q2874600) (← links)
- Cubicity of interval graphs and the claw number (Q3061191) (← links)
- On the Cubicity of Interval Graphs (Q3503487) (← links)