12 research outputs found
Graphs on the Torus and Geometry of Numbers
AbstractWe show that if G is a graph embedded on the torus S and eaeh nonnullhomotopic closed curve on S intersects G at least r times, then G contains at least ⌊34r⌋ pairwise disjoint nonnulihomotopic circuits. The factor 34 is best possible. We prove this by showing the equivalence of this bound to a bound in the two-dimensional geometry of numbers. To show the equivalence, we study integer norms, i.e., norms || · || such that ||x|| is an integer for each integer vector x. In particular, we show that each integer norm in two dimensions has associated with it a graph embedded on the torus, and conversely
Boxicity of graphs on surfaces
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.Comment: 9 pages, 2 figure
Box representations of embedded graphs
A -box is the cartesian product of intervals of and a
-box representation of a graph is a representation of as the
intersection graph of a set of -boxes in . It was proved by
Thomassen in 1986 that every planar graph has a 3-box representation. In this
paper we prove that every graph embedded in a fixed orientable surface, without
short non-contractible cycles, has a 5-box representation. This directly
implies that there is a function , such that in every graph of genus , a
set of at most vertices can be removed so that the resulting graph has a
5-box representation. We show that such a function can be made linear in
. Finally, we prove that for any proper minor-closed class ,
there is a constant such that every graph of
without cycles of length less than has a 3-box representation,
which is best possible.Comment: 16 pages, 6 figures - revised versio
Circuits in graphs embedded on the torus
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especially we focus on methods relating graphs embedded on the torus to integer polygons in the Euclidean plane
Algorithms for Length Spectra of Combinatorial Tori
Consider a weighted, undirected graph cellularly embedded on a topological
surface. The function assigning to each free homotopy class of closed curves
the length of a shortest cycle within this homotopy class is called the marked
length spectrum. The (unmarked) length spectrum is obtained by just listing the
length values of the marked length spectrum in increasing order.
In this paper, we describe algorithms for computing the (un)marked length
spectra of graphs embedded on the torus. More specifically, we preprocess a
weighted graph of complexity in time so that, given a
cycle with edges representing a free homotopy class, the length of a
shortest homotopic cycle can be computed in time. Moreover,
given any positive integer , the first values of its unmarked length
spectrum can be computed in time .
Our algorithms are based on a correspondence between weighted graphs on the
torus and polyhedral norms. In particular, we give a weight independent bound
on the complexity of the unit ball of such norms. As an immediate consequence
we can decide if two embedded weighted graphs have the same marked spectrum in
polynomial time. We also consider the problem of comparing the unmarked spectra
and provide a polynomial time algorithm in the unweighted case and a randomized
polynomial time algorithm otherwise.Comment: 33 pages, 16 figure