Title of article
Incidence coloring of k-degenerated graphs Original Research Article
Author/Authors
Mohammad Hosseini Dolama، نويسنده , , Eric Sopena، نويسنده , , Xuding Zhu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
8
From page
121
To page
128
Abstract
We prove that the incidence coloring number of every k-degenerated graph G is at most Δ(G)+2k−1. For K4-minor free graphs (k=2), we decrease this bound to Δ(G)+2, which is tight. For planar graphs (k=5), we decrease this bound to Δ(G)+7.
Keywords
K4-minor free graph , k-degenerated graph , Incidence coloring , Planar graph
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948927
Link To Document