complete geometric graph, edge colouring


Partition of Complete Geometric Graph into Plane Trees ★★

Author(s):

\begin{conjecture} Every complete geometric graph with an even number of vertices has a partition of its edge set into plane (i.e. non-crossing) spanning trees. \end{conjecture}

Keywords: complete geometric graph, edge colouring

Syndicate content