A synthesis for exactly 3-edge-connected graphs

Details A synthesis for exactly 3-edge-connected graphs A synthesis for exactly 3-edge-connected graphs

2009-05-07

arxiv.org/abs/0905.1053v1

Mathematics

Combinatorics

15 pages, 4 figures Submitted to FOCS 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A synthesis for exactly 3-edge-connected graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A synthesis for exactly 3-edge-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A synthesis for exactly 3-edge-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455806