Incidence coloring of k-degenerated graphs
Résumé
We prove that the incidence coloring number of every k-degenerated graph G is at most \Delta(G)+2k-1. For K_4-minor free graphs (k=2), we decrease this bound to \Delta(G)+2, which is tight. For planar graphs (k=5), we decrease this bound to \Delta(G)+7.