A note on lower bounds for boxicity of graphs
From MaRDI portal
Publication:6571572
DOI10.5614/EJGTA.2024.12.1.12zbMATH Open1541.05128MaRDI QIDQ6571572
Publication date: 12 July 2024
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boxicity and topological invariants
- Box representations of embedded graphs
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Boxicity, poset dimension, and excluded minors
- Boxicity of graphs with bounded degree
- Cubicity, boxicity, and vertex cover
- Interval representations of planar graphs
- On the distribution of roots of algebraic equations with integral coefficients
- Lower bounds for boxicity
- Boxicity of graphs on surfaces
- Boxicity and maximum degree
- Boxicity and treewidth
- Better bounds for poset dimension and boxicity
- Boxicity and Poset Dimension
This page was built for publication: A note on lower bounds for boxicity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571572)
