A constructive characterization of 3-connected triangle-free graphs

Authors:
Matthias Kriesell
Affiliations:
Mathematisches Seminar der Universität Hamburg, Bundesstraße 55, D-20146 Hamburg, Germany
Venue:
Journal of Combinatorial Theory Series B
Year:
2007

Citing 4
Cited 0

Generalizations of critical connectivity of graphs

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Contractible non-edges in 3-connected graphs

Journal of Combinatorial Theory Series B
Graph Theory With Applications

Graph Theory With Applications
Average degree and contractibility

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method to construct the class C of finite simple 3-connected triangle-free graphs from the 3-regular complete bipartite graph K"3","3 and the skeleton of a 3-dimensional cube by sequentially applying one of five operations without leaving C in the intermediate steps. Each of these operations can be considered as a sequence of at most six vertex splittings and edge additions.