Home » Author index

Fiamcik, Jozef


Graph Theory » Coloring » Edge coloring

Acyclic edge-colouring ★★

Author(s): Fiamcik

Conjecture   Every simple graph with maximum degree $ \Delta $ has a proper $ (\Delta+2) $-edge-colouring so that every cycle contains edges of at least three distinct colours.

Keywords: edge-coloring

Posted by mdevos
updated March 7th, 2007
add new comment
Syndicate content