Some results on incidence coloring, star arboricity and domination number

From MaRDI portal
Publication:2869461




Abstract: Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number, were established. Consequently, we deduced an upper bound and a lower bound of the incidence chromatic number for all graphs. Using these bounds, we further reduced the upper bound of the incidence chromatic number of planar graphs and showed that cubic graphs with orders not divisible by four are not 4-incidence colorable. The incidence chromatic numbers of Cartesian product, join and union of graphs were also determined.









This page was built for publication: Some results on incidence coloring, star arboricity and domination number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869461)