Fiamcik, Jozef


Acyclic edge-colouring ★★

Author(s): Fiamcik

\begin{conjecture} Every simple graph with maximum degree $\Delta$ has a proper $(\Delta+2)$-\Def[edge-colouring]{edge-coloring} so that every cycle contains edges of at least three distinct colours. \end{conjecture}

Keywords: edge-coloring

Syndicate content