A synthesis for exactly 3-edge-connected graphs

Simple item page
dc.creatorKingsford, Carl
dc.creatorMarçais, Guillaume
dc.date2009-05-07
dc.date.accessioned2026-07-07T13:12:41Z
dc.date.available2026-07-07T13:12:41Z
dc.descriptionA 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.
dc.description15 pages, 4 figures Submitted to FOCS 2009
dc.identifierhttps://arxiv.org/abs/0905.1053
dc.identifierhttp://arxiv.org/abs/0905.1053
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229651
dc.subjectCombinatorics
dc.subject05C40
dc.titleA synthesis for exactly 3-edge-connected graphs
dc.typetext

Files

Collections

arXiv