Coloring decompositions of complete geometric graphs

Clemens Huemer, Dolores Lara, Christian Rubio-Montiel

A decomposition of a non-empty simple graph $G$ is a pair $[G,P]$, such that $P$ is a set of non-empty induced subgraphs of $G$, and every edge of $G$ belongs to exactly one subgra…