Local boxicity and maximum degree
From MaRDI portal
Publication:2675846
DOI10.1016/j.disc.2022.113085zbMath1497.05189arXiv1810.02963OpenAlexW3132631650WikidataQ114190476 ScholiaQ114190476MaRDI QIDQ2675846
Atrayee Majumder, Rogers Mathew
Publication date: 26 September 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02963
Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Separation dimension of graphs and hypergraphs
- Boxicity of line graphs
- Boxicity and topological invariants
- Ferrers dimension and boxicity
- Comparing Dushnik-Miller dimension, Boolean dimension and local dimension
- Geometric representation of graphs in low dimension using axis parallel boxes
- Three ways to cover a graph
- Boxicity of graphs with bounded degree
- On a product dimension of graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Capacities: From information theory to extremal set theory
- Covering a graph by complete bipartite graphs
- Boolean dimension and local dimension
- Local and union boxicity
- On difference graphs and the local dimension of posets
- Local boxicity
- Local dimension is unbounded for planar posets
- Boxicity and cubicity of product graphs
- Boxicity and maximum degree
- Separation Dimension of Bounded Degree Graphs
- The dimension of random ordered sets
- Zero-error information theory
- Better bounds for poset dimension and boxicity
- Boxicity and Poset Dimension