61 research outputs found
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Deciding whether a given graph has a square root is a classical problem that
has been studied extensively both from graph theoretic and from algorithmic
perspectives. The problem is NP-complete in general, and consequently
substantial effort has been dedicated to deciding whether a given graph has a
square root that belongs to a particular graph class. There are both
polynomial-time solvable and NP-complete cases, depending on the graph class.
We contribute with new results in this direction. Given an arbitrary input
graph G, we give polynomial-time algorithms to decide whether G has an
outerplanar square root, and whether G has a square root that is of pathwidth
at most 2
A generalization of the Art Gallery Theorem
Several domination results have been obtained for maximal outerplanar graphs
(mops). The classical domination problem is to minimize the size of a set
of vertices of an -vertex graph such that , the graph obtained
by deleting the closed neighborhood of , contains no vertices. A classical
result of Chv\'{a}tal, the Art Gallery Theorem, tells us that the minimum size
is at most if is a mop. Here we consider a modification by allowing
to have a maximum degree of at most . Let denote the
size of a smallest set for which this is achieved. If , then
trivially . Let be a mop on
vertices, of which are of degree~. Sharp bounds on have
been obtained for and , namely and . We prove that
for any , and that this bound is sharp. We also prove that
is a sharp upper bound on the domination number of .Comment: arXiv admin note: substantial text overlap with arXiv:1903.1229
Isolation of squares in graphs
Given a set of graphs, we call a copy of a graph in
an -graph. The -isolation number of a
graph , denoted by , is the size of a smallest subset
of the vertex set such that the closed neighbourhood of
intersects the vertex sets of the -graphs contained by
(equivalently, contains no -graph). Thus,
is the domination number of . The second author showed
that if is the set of cycles and is a connected -vertex
graph that is not a triangle, then . This bound is attainable for every and solved
a problem of Caro and Hansberg. A question that arises immediately is how
smaller an upper bound can be if for some ,
where is a cycle of length . The problem is to determine the smallest
real number (if it exists) such that for some finite set
of graphs, for every connected graph
that is not an -graph. The above-mentioned result yields and . The second author also showed that
if and exists, then . We prove that
and determine , which consists of three
-vertex graphs and six -vertex graphs. The -vertex graphs in
were fully determined by means of a computer program. A method
that has the potential of yielding similar results is introduced.Comment: 15 pages, 1 figure. arXiv admin note: text overlap with
arXiv:2110.0377
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
When can a plane graph with prescribed edge lengths and prescribed angles
(from among \}) be folded flat to lie in an
infinitesimally thin line, without crossings? This problem generalizes the
classic theory of single-vertex flat origami with prescribed mountain-valley
assignment, which corresponds to the case of a cycle graph. We characterize
such flat-foldable plane graphs by two obviously necessary but also sufficient
conditions, proving a conjecture made in 2001: the angles at each vertex should
sum to , and every face of the graph must itself be flat foldable.
This characterization leads to a linear-time algorithm for testing flat
foldability of plane graphs with prescribed edge lengths and angles, and a
polynomial-time algorithm for counting the number of distinct folded states.Comment: 21 pages, 10 figure
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
In 1988, Vazirani gave an NC algorithm for computing the number of perfect
matchings in -minor-free graphs by building on Kasteleyn's scheme for
planar graphs, and stated that this "opens up the possibility of obtaining an
NC algorithm for finding a perfect matching in -free graphs." In this
paper, we finally settle this 30-year-old open problem. Building on recent NC
algorithms for planar and bounded-genus perfect matching by Anari and Vazirani
and later by Sankowski, we obtain NC algorithms for perfect matching in any
minor-closed graph family that forbids a one-crossing graph. This family
includes several well-studied graph families including the -minor-free
graphs and -minor-free graphs. Graphs in these families not only have
unbounded genus, but can have genus as high as . Our method applies as
well to several other problems related to perfect matching. In particular, we
obtain NC algorithms for the following problems in any family of graphs (or
networks) with a one-crossing forbidden minor:
Determining whether a given graph has a perfect matching and if so,
finding one.
Finding a minimum weight perfect matching in the graph, assuming
that the edge weights are polynomially bounded.
Finding a maximum -flow in the network, with arbitrary
capacities.
The main new idea enabling our results is the definition and use of
matching-mimicking networks, small replacement networks that behave the same,
with respect to matching problems involving a fixed set of terminals, as the
larger network they replace.Comment: 21 pages, 6 figure
Minor-Obstructions for Apex-Pseudoforests
A graph is called a pseudoforest if none of its connected components contains
more than one cycle. A graph is an apex-pseudoforest if it can become a
pseudoforest by removing one of its vertices. We identify 33 graphs that form
the minor-obstruction set of the class of apex-pseudoforests, i.e., the set of
all minor-minimal graphs that are not apex-pseudoforests
- …