On the Incidence Coloring of Outerplanar Graphs

Jing Qu · 2011

Graph incidence coloring is a reflection from incidence set to the color set which enables any two adjacent elements present different images. This thesis provides some more clear explanation to the Incidence coloring conjecture of Brualdi and Massey.

Read the paper · More papers on PaperTik