Constructing minimally 3-connected graphs

by   J. P. Costalonga, et al.

A 3-connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the results in (Dawes, JCTB 40, 159-168, 1986) using two operations: adding an edge between non-adjacent vertices and splitting a vertex. In order to test sets of vertices and edges for 3-compatibility, which depends on the cycles of the graph, we develop a method for obtaining the cycles of G' from the cycles of G, where G' is obtained from G by one of the two operations above. We eliminate isomorphs using certificates generated by McKay's isomorphism checker nauty. The algorithm consecutively constructs the non-isomorphic minimally 3-connected graphs with n vertices and m edges from the non-isomorphic minimally 3-connected graphs with n-1 vertices and m-2 edges, n-1 vertices and m-3 edges, and n-2 vertices and m-3 edges.



There are no comments yet.


page 1

page 2

page 3

page 4


Reconfiguration of graph minors

Under the reconfiguration framework, we consider the various ways that a...

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles

In 2019, Letzter confirmed a conjecture of Balogh, Barát, Gerbner, Gyárf...

The Complexity of Mixed-Connectivity

We investigate the parameterized complexity in a and b of determining wh...

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...

Dynamics of epidemic spreading on connected graphs

We propose a new model that describes the dynamics of epidemic spreading...

Connected Components in Undirected Set–Based Graphs. Applications in Object–Oriented Model Manipulation

This work introduces a novel algorithm for finding the connected compone...

Betti numbers of unordered configuration spaces of small graphs

The purpose of this document is to provide data about known Betti number...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.