14,153 research outputs found
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
Liftings and stresses for planar periodic frameworks
We formulate and prove a periodic analog of Maxwell's theorem relating
stressed planar frameworks and their liftings to polyhedral surfaces with
spherical topology. We use our lifting theorem to prove deformation and
rigidity-theoretic properties for planar periodic pseudo-triangulations,
generalizing features known for their finite counterparts. These properties are
then applied to questions originating in mathematical crystallography and
materials science, concerning planar periodic auxetic structures and ultrarigid
periodic frameworks.Comment: An extended abstract of this paper has appeared in Proc. 30th annual
Symposium on Computational Geometry (SOCG'14), Kyoto, Japan, June 201
- …