4,375 research outputs found
Diameter and Treewidth in Minor-Closed Graph Families
It is known that any planar graph with diameter D has treewidth O(D), and
this fact has been used as the basis for several planar graph algorithms. We
investigate the extent to which similar relations hold in other graph families.
We show that treewidth is bounded by a function of the diameter in a
minor-closed family, if and only if some apex graph does not belong to the
family. In particular, the O(D) bound above can be extended to bounded-genus
graphs. As a consequence, we extend several approximation algorithms and exact
subgraph isomorphism algorithms from planar graphs to other graph families.Comment: 15 pages, 12 figure
A Note on the Maximum Genus of Graphs with Diameter 4
Let G be a simple graph with diameter four, if G does not contain complete
subgraph K3 of order three
On the dual graph of Cohen-Macaulay algebras
Given a projective algebraic set X, its dual graph G(X) is the graph whose
vertices are the irreducible components of X and whose edges connect components
that intersect in codimension one. Hartshorne's connectedness theorem says that
if (the coordinate ring of) X is Cohen-Macaulay, then G(X) is connected. We
present two quantitative variants of Hartshorne's result:
1) If X is a Gorenstein subspace arrangement, then G(X) is r-connected, where
r is the Castelnuovo-Mumford regularity of X. (The bound is best possible; for
coordinate arrangements, it yields an algebraic extension of Balinski's theorem
for simplicial polytopes.)
2) If X is a canonically embedded arrangement of lines no three of which meet
in the same point, then the diameter of the graph G(X) is not larger than the
codimension of X. (The bound is sharp; for coordinate arrangements, it yields
an algebraic expansion on the recent combinatorial result that the Hirsch
conjecture holds for flag normal simplicial complexes.)Comment: Minor changes throughout, Remark 4.1 expanded, to appear in IMR
The degree-diameter problem for sparse graph classes
The degree-diameter problem asks for the maximum number of vertices in a
graph with maximum degree and diameter . For fixed , the answer
is . We consider the degree-diameter problem for particular
classes of sparse graphs, and establish the following results. For graphs of
bounded average degree the answer is , and for graphs of
bounded arboricity the answer is \Theta(\Delta^{\floor{k/2}}), in both cases
for fixed . For graphs of given treewidth, we determine the the maximum
number of vertices up to a constant factor. More precise bounds are given for
graphs of given treewidth, graphs embeddable on a given surface, and
apex-minor-free graphs
Computing the Girth of a Planar Graph in Linear Time
The girth of a graph is the minimum weight of all simple cycles of the graph.
We study the problem of determining the girth of an n-node unweighted
undirected planar graph. The first non-trivial algorithm for the problem, given
by Djidjev, runs in O(n^{5/4} log n) time. Chalermsook, Fakcharoenphol, and
Nanongkai reduced the running time to O(n log^2 n). Weimann and Yuster further
reduced the running time to O(n log n). In this paper, we solve the problem in
O(n) time.Comment: 20 pages, 7 figures, accepted to SIAM Journal on Computin
- …