Boxicity of graphs on surfaces
From MaRDI portal
Publication:2376090
Abstract: The boxicity of a graph is the least integer for which there exist interval graphs , , such that . Scheinerman proved in 1984 that outerplanar graphs have boxicity at most two and Thomassen proved in 1986 that planar graphs have boxicity at most three. In this note we prove that the boxicity of toroidal graphs is at most 7, and that the boxicity of graphs embeddable in a surface of genus is at most . This result yields improved bounds on the dimension of the adjacency poset of graphs on surfaces.
Recommendations
Cites work
- A special planar satisfiability problem and a consequence of its NP- completeness
- Adjacency posets of planar graphs
- An extremal function for contractions of graphs
- Boxicity and maximum degree
- Boxicity and treewidth
- Coloring with no 2-colored \(P_4\)'s
- Cubicity, degeneracy, and crossing number
- Dimension, graph and hypergraph coloring
- Graphs on surfaces
- Graphs on the torus and geometry of numbers
- scientific article; zbMATH DE number 3737705 (Why is no real title available?)
- scientific article; zbMATH DE number 3566474 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- scientific article; zbMATH DE number 2209736 (Why is no real title available?)
- Interval representations of planar graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Minimal scrambling sets of simple orders
- On acyclic colorings of graphs on surfaces
- Star coloring and acyclic coloring of locally planar graphs
Cited in
(17)- Boxicity of Halin graphs
- Poset boxicity of graphs
- Local and union boxicity
- Chronological rectangle digraphs which are two-terminal series-parallel
- Adjacency posets of outerplanar graphs
- On the boxicity of Kneser graphs and complements of line graphs
- Separation dimension of graphs and hypergraphs
- Boxicity and topological invariants
- Better bounds for poset dimension and boxicity
- Box representations of embedded graphs
- A note on lower bounds for boxicity of graphs
- Boxicity of circular arc graphs
- Boxicity, poset dimension, and excluded minors
- A survey on the boxicity and cubicity of graphs
- Bounds for boxicity of circular clique graphs and zero-divisor graphs
- A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\)
- On the stab number of rectangle intersection graphs
This page was built for publication: Boxicity of graphs on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376090)