Boxicity of graphs on surfaces

From MaRDI portal
Publication:2376090

DOI10.1007/S00373-012-1130-XzbMATH Open1267.05083arXiv1107.1953OpenAlexW3098458351MaRDI QIDQ2376090FDOQ2376090


Authors: L. Esperet, Gwenaël Joret Edit this on Wikidata


Publication date: 26 June 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: The boxicity of a graph G=(V,E) is the least integer k for which there exist k interval graphs Gi=(V,Ei), 1leilek, such that E=E1cap...capEk. 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 Sigma of genus g is at most 5g+3. This result yields improved bounds on the dimension of the adjacency poset of graphs on surfaces.


Full work available at URL: https://arxiv.org/abs/1107.1953




Recommendations




Cites Work


Cited In (15)





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)