Boxicity of Graphs on Surfaces |
| |
Authors: | Louis Esperet Gwenaël Joret |
| |
Institution: | 1. Laboratoire G-SCOP, CNRS, Grenoble-INP, Grenoble, France 2. Département d’Informatique, Université Libre de Bruxelles, Brussels, Belgium
|
| |
Abstract: | The boxicity of a graph G = (V, E) is the least integer k for which there exist k interval graphs G i = (V, E i ), 1 ≤ i ≤ k, such that ${E = E_1 \cap \cdots \cap E_k}$ . 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 g is at most 5g + 3. This result yields improved bounds on the dimension of the adjacency poset of graphs on surfaces. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|