1 research outputs found
Local Balance in Graph Decompositions
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