619 research outputs found
Graph isomorphism for (H1,H2)-free graphs : an almost complete dichotomy.
We almost completely resolve the computational complexity
of Graph Isomorphism for classes of graphs characterized by two forbidden
induced subgraphs H1 and H2. Schweitzer settled the complexity of
this problem restricted to (H1;H2)-free graphs for all but a nite number
of pairs (H1;H2), but without explicitly giving the number of open cases.
Grohe and Schweitzer proved that Graph Isomorphism is polynomialtime
solvable on graph classes of bounded clique-width. By combining
known results with a number of new results, we reduce the number of
open cases to seven. By exploiting the strong relationship between Graph
Isomorphism and clique-width, we simultaneously reduce the number of
open cases for boundedness of clique-width for (H1;H2)-free graphs to
ve
Towards an Isomorphism Dichotomy for Hereditary Graph Classes
In this paper we resolve the complexity of the isomorphism problem on all but
finitely many of the graph classes characterized by two forbidden induced
subgraphs. To this end we develop new techniques applicable for the structural
and algorithmic analysis of graphs. First, we develop a methodology to show
isomorphism completeness of the isomorphism problem on graph classes by
providing a general framework unifying various reduction techniques. Second, we
generalize the concept of the modular decomposition to colored graphs, allowing
for non-standard decompositions. We show that, given a suitable decomposition
functor, the graph isomorphism problem reduces to checking isomorphism of
colored prime graphs. Third, we extend the techniques of bounded color valence
and hypergraph isomorphism on hypergraphs of bounded color size as follows. We
say a colored graph has generalized color valence at most k if, after removing
all vertices in color classes of size at most k, for each color class C every
vertex has at most k neighbors in C or at most k non-neighbors in C. We show
that isomorphism of graphs of bounded generalized color valence can be solved
in polynomial time.Comment: 37 pages, 4 figure
Induced Minor Free Graphs: Isomorphism and Clique-width
Given two graphs and , we say that contains as an induced
minor if a graph isomorphic to can be obtained from by a sequence of
vertex deletions and edge contractions. We study the complexity of Graph
Isomorphism on graphs that exclude a fixed graph as an induced minor. More
precisely, we determine for every graph that Graph Isomorphism is
polynomial-time solvable on -induced-minor-free graphs or that it is
GI-complete. Additionally, we classify those graphs for which
-induced-minor-free graphs have bounded clique-width. These two results
complement similar dichotomies for graphs that exclude a fixed graph as an
induced subgraph, minor, or subgraph.Comment: 16 pages, 5 figures. An extended abstract of this paper previously
appeared in the proceedings of the 41st International Workshop on
Graph-Theoretic Concepts in Computer Science (WG 2015
On 2-switches and isomorphism classes
A 2-switch is an edge addition/deletion operation that changes adjacencies in
the graph while preserving the degree of each vertex. A well known result
states that graphs with the same degree sequence may be changed into each other
via sequences of 2-switches. We show that if a 2-switch changes the isomorphism
class of a graph, then it must take place in one of four configurations. We
also present a sufficient condition for a 2-switch to change the isomorphism
class of a graph. As consequences, we give a new characterization of matrogenic
graphs and determine the largest hereditary graph family whose members are all
the unique realizations (up to isomorphism) of their respective degree
sequences.Comment: 11 pages, 6 figure
Bucolic Complexes
We introduce and investigate bucolic complexes, a common generalization of
systolic complexes and of CAT(0) cubical complexes. They are defined as simply
connected prism complexes satisfying some local combinatorial conditions. We
study various approaches to bucolic complexes: from graph-theoretic and
topological perspective, as well as from the point of view of geometric group
theory. In particular, we characterize bucolic complexes by some properties of
their 2-skeleta and 1-skeleta (that we call bucolic graphs), by which several
known results are generalized. We also show that locally-finite bucolic
complexes are contractible, and satisfy some nonpositive-curvature-like
properties.Comment: 45 pages, 4 figure
- …