72,695 research outputs found
Excluding a Weakly 4-connected Minor
A 3-connected graph is called weakly 4-connected if min holds for all 3-separations of . A 3-connected graph is called quasi 4-connected if min . We first discuss how to decompose a 3-connected graph into quasi 4-connected components. We will establish a chain theorem which will allow us to easily generate the set of all quasi 4-connected graphs. Finally, we will apply these results to characterizing all graphs which do not contain the Pyramid as a minor, where the Pyramid is the weakly 4-connected graph obtained by performing a transformation to the octahedron. This result can be used to show an interesting characterization of quasi 4-connected, outer-projective graphs
Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cylinder and torus
We extend the notion of canonical ordering (initially developed for planar
triangulations and 3-connected planar maps) to cylindric (essentially simple)
triangulations and more generally to cylindric (essentially internally)
-connected maps. This allows us to extend the incremental straight-line
drawing algorithm of de Fraysseix, Pach and Pollack (in the triangulated case)
and of Kant (in the -connected case) to this setting. Precisely, for any
cylindric essentially internally -connected map with vertices, we
can obtain in linear time a periodic (in ) straight-line drawing of that
is crossing-free and internally (weakly) convex, on a regular grid
, with and ,
where is the face-distance between the two boundaries. This also yields an
efficient periodic drawing algorithm for graphs on the torus. Precisely, for
any essentially -connected map on the torus (i.e., -connected in the
periodic representation) with vertices, we can compute in linear time a
periodic straight-line drawing of that is crossing-free and (weakly)
convex, on a periodic regular grid
, with and
, where is the face-width of . Since ,
the grid area is .Comment: 37 page
Weak degeneracy of graphs
Motivated by the study of greedy algorithms for graph coloring, we introduce
a new graph parameter, which we call weak degeneracy. By definition, every
-degenerate graph is also weakly -degenerate. On the other hand, if
is weakly -degenerate, then (and, moreover, the same
bound holds for the list-chromatic and even the DP-chromatic number of ). It
turns out that several upper bounds in graph coloring theory can be phrased in
terms of weak degeneracy. For example, we show that planar graphs are weakly
-degenerate, which implies Thomassen's famous theorem that planar graphs are
-list-colorable. We also prove a version of Brooks's theorem for weak
degeneracy: a connected graph of maximum degree is weakly
-degenerate unless . (By contrast, all -regular
graphs have degeneracy .) We actually prove an even stronger result, namely
that for every , there is such that if is a graph
of weak degeneracy at least , then either contains a -clique or
the maximum average degree of is at least . Finally, we show
that graphs of maximum degree and either of girth at least or of
bounded chromatic number are weakly -degenerate, which
is best possible up to the value of the implied constant.Comment: 21 p
- …