Local Balance in Graph Decompositions
Combinatorics
2020-02-21 v1
Abstract
In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions. In the basic case where a single graph with colored loops is used as a block, an existence theory for such decompositions follows as a straightforward generalization of previous work on balanced graph decompositions.
Keywords
Cite
@article{arxiv.2002.08895,
title = {Local Balance in Graph Decompositions},
author = {Flora C. Bowditch and Peter J. Dukes},
journal= {arXiv preprint arXiv:2002.08895},
year = {2020}
}