| |
of a graph |
|
Abstract: It is proved that edges of a graph $G$ can be coloured using $\chi(G)+2$ colours so that any two adjacent vertices have distinct sets of colours of their incident edges. In the case of a bipartite graph three colours are sufficient. Contact the authors: hornak@science.upjs.sk, mwozniak@uci.agh.edu.pl Download PDF version of the preprint. |