Coloring decompositions of complete geometric graphs
Sign Up to like & getrecommendations! Published in 2019 at "Acta Mathematica Hungarica"
DOI: 10.1007/s10474-019-00963-0
Abstract: 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 subgraph in… read more here.
Keywords: geometric graphs; chromatic index; complete geometric; decomposition ... See more keywords