Characterizing Sparse Graphs by Map Decompositions

Authors

Ruth Haas, Smith CollegeFollow
Audrey Lee, University of Massachusetts Amherst
Ileana Streinu, Smith CollegeFollow
Louis Theran, University of Massachusetts Amherst

Document Type

Article

Publication Date

8-2007

Publication Title

Journal of Combinatorial Mathematics and Combinatorial Computing

Abstract

A map is a graph that admits an orientation of its edges so that each vertex has out-degree exactly 1. We characterize graphs which admit a decomposition into k edge-disjoint maps after: (1) the addition of any ℓ edges; (2) the addition of some ℓ edges. These graphs are identified with classes of sparse graphs; the results are also given in matroidal terms.

Volume

62

First Page

3

Last Page

11

ISSN

0835-3026

Comments

Peer reviewed accepted manuscript.

Recommended Citation

Haas, Ruth; Lee, Audrey; Streinu, Ileana; and Theran, Louis, "Characterizing Sparse Graphs by Map Decompositions" (2007). Mathematics and Statistics: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/mth_facpubs/4