A synthesis for exactly 3-edge-connected graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
15 pages, 4 figures Submitted to FOCS 2009

Keywords

Combinatorics, 05C40

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/229651

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.1053
 http://arxiv.org/abs/0905.1053

Collections

arXiv