Year: 2007
Type: preprint
Abstract: A {\bf 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 {\it any} $\ell$ edges; (2) the addition of {\it some} $\ell$ edges. These graphs are identified with classes of {\it sparse} graphs; the results are also given in matroidal terms.
Source: arXiv (Cornell University)
Authors: Haas, Ruth, Lee, Audrey, Streinu, Ileana, Theran, Louis
Institutions: Smith College, University of Massachusetts Amherst
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W1674234985