Characterizing Sparse Graphs by Map Decompositions
Combinatorics
2011-11-09 v1
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 edge-disjoint maps after: (1) the addition of {\it any} edges; (2) the addition of {\it some} edges. These graphs are identified with classes of {\it sparse} graphs; the results are also given in matroidal terms.
Keywords
Cite
@article{arxiv.0704.3843,
title = {Characterizing Sparse Graphs by Map Decompositions},
author = {Ruth Haas and Audrey Lee and Ileana Streinu and Louis Theran},
journal= {arXiv preprint arXiv:0704.3843},
year = {2011}
}