Boxicity of graphs with bounded degree
From MaRDI portal
Publication:1024326
DOI10.1016/j.ejc.2008.10.003zbMath1229.05140MaRDI 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
05C35: Extremal problems in graph theory
Related Items
Better bounds for poset dimension and boxicity, Boxicity of line graphs, Vertex cover problem parameterized above and below tight bounds, Boxicity of circular arc graphs, A constant factor approximation algorithm for boxicity of circular arc graphs, Boxicity and cubicity of asteroidal triple free graphs, Local boxicity, Intersection dimension and graph invariants, Chronological rectangle digraphs which are two-terminal series-parallel, Cubicity, degeneracy, and crossing number, Local boxicity and maximum degree, On the boxicity of Kneser graphs and complements of line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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