![](/files/happy5.png)
geometric complete graph, colouring
Edge-Colouring Geometric Complete Graphs ★★
Author(s): Hurtado
Question What is the minimum number of colours such that every complete geometric graph on
vertices has an edge colouring such that:
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
- \item[Variant A] crossing edges get distinct colours, \item[Variant B] disjoint edges get distinct colours, \item[Variant C] non-disjoint edges get distinct colours, \item[Variant D] non-crossing edges get distinct colours.
Keywords: geometric complete graph, colouring
![Syndicate content Syndicate content](/misc/feed.png)