Boxicity of graphs with bounded degree
From MaRDI portal
Publication:1024326
DOI10.1016/j.ejc.2008.10.003zbMath1229.05140OpenAlexW2106120818MaRDI QIDQ1024326
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.10.003
Related Items
Local boxicity ⋮ Chronological rectangle digraphs which are two-terminal series-parallel ⋮ Local boxicity and maximum degree ⋮ Boxicity of line graphs ⋮ On the boxicity of Kneser graphs and complements of line graphs ⋮ Vertex cover problem parameterized above and below tight bounds ⋮ Intersection dimension and graph invariants ⋮ Boxicity of circular arc graphs ⋮ Boxicity and cubicity of asteroidal triple free graphs ⋮ Cubicity, degeneracy, and crossing number ⋮ A constant factor approximation algorithm for boxicity of circular arc graphs ⋮ Better bounds for poset dimension and boxicity
Cites Work
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Interval representations of planar graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Boxicity and maximum degree
- Boxicity and treewidth
- On the chordality of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
