16 research outputs found
Characterizing and generalizing cycle completable graphs
The family of cycle completable graphs has several cryptomorphic
descriptions, the equivalence of which has heretofore been proven by a
laborious implication-cycle that detours through a motivating matrix completion
problem. We give a concise proof, partially by introducing a new
characterization. Then we generalize this family to ``-quasichordal''
graphs, with three natural characterizations.Comment: 8 page
Parameterized Leaf Power Recognition via Embedding into Graph Products
The k-leaf power graph G of a tree T is a graph whose vertices are the leaves of T and whose edges connect pairs of leaves at unweighted distance at most k in T. Recognition of the k-leaf power graphs for k >= 6 is still an open problem. In this paper, we provide an algorithm for this problem for sparse leaf power graphs. Our result shows that the problem of recognizing these graphs is fixed-parameter tractable when parameterized both by k and by the degeneracy of the given graph. To prove this, we describe how to embed the leaf root of a leaf power graph into a product of the graph with a cycle graph. We bound the treewidth of the resulting product in terms of k and the degeneracy of G. As a result, we can use methods based on monadic second-order logic (MSO_2) to recognize the existence of a leaf power as a subgraph of the product graph
End-faithful spanning trees in graphs without normal spanning trees
Schmidt characterised the class of rayless graphs by an ordinal rank
function, which makes it possible to prove statements about rayless graphs by
transfinite induction. Halin asked whether Schmidt's rank function can be
generalised to characterise other important classes of graphs. We answer
Halin's question in the affirmative. Another largely open problem raised by
Halin asks for a characterisation of the class of graphs with an end-faithful
spanning tree. A well-studied subclass is formed by the graphs with a normal
spanning tree. We determine a larger subclass, the class of normally traceable
graphs, which consists of the connected graphs with a rayless
tree-decomposition into normally spanned parts. Investigating the class of
normally traceable graphs further we prove that, for every normally traceable
graph, having a rayless spanning tree is equivalent to all its ends being
dominated. Our proofs rely on a characterisation of the class of normally
traceable graphs by an ordinal rank function that we provide.Comment: 9 pages, no figure
Approximating pathwidth for graphs of small treewidth
We describe a polynomial-time algorithm which, given a graph with
treewidth , approximates the pathwidth of to within a ratio of
. This is the first algorithm to achieve an
-approximation for some function .
Our approach builds on the following key insight: every graph with large
pathwidth has large treewidth or contains a subdivision of a large complete
binary tree. Specifically, we show that every graph with pathwidth at least
has treewidth at least or contains a subdivision of a complete
binary tree of height . The bound is best possible up to a
multiplicative constant. This result was motivated by, and implies (with
), the following conjecture of Kawarabayashi and Rossman (SODA'18): there
exists a universal constant such that every graph with pathwidth
has treewidth at least or contains a subdivision of a
complete binary tree of height .
Our main technical algorithm takes a graph and some (not necessarily
optimal) tree decomposition of of width in the input, and it computes
in polynomial time an integer , a certificate that has pathwidth at
least , and a path decomposition of of width at most . The
certificate is closely related to (and implies) the existence of a subdivision
of a complete binary tree of height . The approximation algorithm for
pathwidth is then obtained by combining this algorithm with the approximation
algorithm of Feige, Hajiaghayi, and Lee (STOC'05) for treewidth
Restricted String Representations
A string representation of a graph assigns to every vertex a curve in the plane so that two curves intersect if and only if the represented vertices are adjacent. This work investigates string representations of graphs with an emphasis on the shapes of curves and the way they intersect. We strengthen some previously known results and show that every planar graph
has string representations where every curve consists of axis-parallel line segments with at most two bends (those are the so-called -VPG representations) and simultaneously two curves intersect each other at most once (those are the
so-called 1-string representations). Thus, planar graphs are -VPG -string graphs. We further show that with some restrictions on the shapes of the curves, string representations can be used to produce approximation algorithms for several hard problems. The -VPG representations of planar graphs satisfy these restrictions. We attempt to further
restrict the number of bends in VPG representations for subclasses of planar graphs, and investigate -VPG
representations. We propose new classes of string representations for planar graphs that we call ``order-preserving.'' Order-preservation is an interesting property which relates the string representation to the planar embedding of the graph, and we believe that it might prove useful when constructing string representations. Finally, we extend our investigation
of string representations to string representations that require some curves to intersect multiple times. We show that there are outer-string graphs that require an exponential number of crossings in their outer-string representations. Our construction also proves that 1-planar graphs, i.e., graphs that are no longer planar, yet fairly close to planar graphs, may have string representations, but they are not always 1-string
Structured Decompositions: Structural and Algorithmic Compositionality
We introduce structured decompositions: category-theoretic generalizations of
many combinatorial invariants -- including tree-width, layered tree-width,
co-tree-width and graph decomposition width -- which have played a central role
in the study of structural and algorithmic compositionality in both graph
theory and parameterized complexity. Structured decompositions allow us to
generalize combinatorial invariants to new settings (for example decompositions
of matroids) in which they describe algorithmically useful structural
compositionality. As an application of our theory we prove an algorithmic meta
theorem for the Sub_P-composition problem which, when instantiated in the
category of graphs, yields compositional algorithms for NP-hard problems such
as: Maximum Bipartite Subgraph, Maximum Planar Subgraph and Longest Path
The Vulcan game of Kal-toh: Finding or making triconnected planar subgraphs
In the game of Kal-toh depicted in the television series Star Trek: Voyager, players
attempt to create polyhedra by adding to a jumbled collection of metal rods. Inspired by
this fictional game, we formulate graph-theoretical questions about polyhedral (triconnected and planar) subgraphs in an on-line environment. The problem of determining the existence of a polyhedral subgraph within a graph G is shown to be NP-hard, and we also give some non-trivial upper bounds for the problem of determining the minimum number of edge additions necessary to guarantee the existence of a polyhedral subgraph in G. A two-player
formulation of Kal-toh is also explored, in which the first player to form a target subgraph is declared the winner. We show a polynomial-time solution for simple cases of this game but conjecture that the general problem is NP-hard
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application