Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649322 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
This paper proves that if GG is a cubic graph which has a Hamiltonian path or GG is a bridgeless cubic graph of large girth, then its incidence coloring number is at most 5. By relating the incidence coloring number of a graph GG to the chromatic number of G2G2, we present simple proofs of some known results, and characterize regular graphs GG whose incidence coloring number equals Δ(G)+1Δ(G)+1.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jiaojiao Wu,