A synthesis for exactly 3-edge-connected graphs
Combinatorics
2009-05-08 v1
Abstract
A multigraph is exactly k-edge-connected if there are exactly k edge-disjoint paths between any pair of vertices. We characterize the class of exactly 3-edge-connected graphs, giving a synthesis involving two operations by which every exactly 3-edge-connected multigraph can be generated. Slightly modified syntheses give the planar exactly 3-edge-connected graphs and the exactly 3-edge-connected graphs with the fewest possible edges.
Keywords
Cite
@article{arxiv.0905.1053,
title = {A synthesis for exactly 3-edge-connected graphs},
author = {Carl Kingsford and Guillaume Marçais},
journal= {arXiv preprint arXiv:0905.1053},
year = {2009}
}
Comments
15 pages, 4 figures Submitted to FOCS 2009