Boxicity, poset dimension, and excluded minors
From MaRDI portal
Publication:668021
zbMath1409.05085arXiv1804.00850MaRDI QIDQ668021
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.00850
Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Unnamed Item ⋮ Better bounds for poset dimension and boxicity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Boxicity and topological invariants
- Lower bound of the Hadwiger number of graphs by their average degree
- Adjacency posets of planar graphs
- Interval representations of planar graphs
- A note on circular dimension
- The circular dimension of a graph
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Dimension, graph and hypergraph coloring
- Orderings on graphs and game coloring number
- Nowhere dense graph classes and dimension
- Boxicity of graphs on surfaces
- Intersection Dimension and Maximum Degree
- An extremal function for contractions of graphs
- The dimension of random ordered sets
- Topological Cliques in Graphs
- Improper colourings inspired by Hadwiger's conjecture
- Topological Minors of Cover Graphs and Dimension
- Better bounds for poset dimension and boxicity
- Boxicity and Poset Dimension
- On the generalised colouring numbers of graphs that exclude a fixed minor
This page was built for publication: Boxicity, poset dimension, and excluded minors