Reconfiguration of graph minors

by   Benjamin Moore, et al.

Under the reconfiguration framework, we consider the various ways that a target graph H is a minor of a host graph G, where a subgraph of G can be transformed into H by means of edge contraction (replacement of both endpoints of an edge by a new vertex adjacent to any vertex adjacent to either endpoint). Equivalently, an H-model of G is a labeling of the vertices of G with the vertices of H, where the contraction of all edges between identically-labeled vertices results in a graph containing representations of all edges in H. We explore the properties of G and H that result in a connected reconfiguration graph, in which nodes represent H-models and two nodes are adjacent if their corresponding H-models differ by the label of a single vertex of G. Various operations on G or H are shown to preserve connectivity. In addition, we demonstrate properties of graphs G that result in connectivity for the target graphs K_2, K_3, and K_4, including a full characterization of graphs G that result in connectivity for K_2-models, as well as the relationship between connectivity of G and other H-models.


page 1

page 2

page 3

page 4


Constructing minimally 3-connected graphs

A 3-connected graph is minimally 3-connected if removal of any edge dest...

Connectivity of Triangulation Flip Graphs in the Plane

Given a finite point set P in general position in the plane, a full tria...

The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation

It is known that any chordal graph on n vertices can be represented as t...

The complete set of minimal simple graphs that support unsatisfiable 2-CNFs

A propositional logic sentence in conjunctive normal form that has claus...

Graph connectivity in log-diameter steps using label propagation

The fastest deterministic algorithms for connected components take logar...

Generalized splines on graphs with two labels and polynomial splines on cycles

A generalized spline on a graph G with edges labeled by ideals in a ring...

Õptimal Dual Vertex Failure Connectivity Labels

In this paper we present succinct labeling schemes for supporting connec...

Please sign up or login with your details

Forgot password? Click here to reset