Carl Kingsford, Guillaume Marçais
Published 2009-05-07Version 1
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.
Comments: 15 pages, 4 figures Submitted to FOCS 2009
Operations on Fuzzy Incidence Graphs and Strong Incidence Domination
Multigraphs with $Δ\ge 3$ are Totally-$(2Δ-1)$-choosable
F-index of graphs based on new operations related to the join of graphs
![QR code for arXiv:0905.1053 [math.CO]](http://oss.arxitics.com/images/favicon.svg)