Some results on incidence coloring, star arboricity and domination number
From MaRDI portal
Publication:2869461
zbMATH Open1278.05110arXiv1203.6143MaRDI QIDQ2869461FDOQ2869461
Authors: Pak Kiu Sun, Wai Chee Shiu 
Publication date: 3 January 2014
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1203.6143
Recommendations
- On incidence coloring and star arboricity of graphs
- Fractional incidence coloring and star arboricity of graphs.
- Some results on the incidence coloring number of a graph
- Incidence Coloring Game and Arboricity of Graphs
- Some theorems concerning the star chromatic number of a graph
- On \(n\)-stars in colorings and orientations of graphs
- On some domination colorings of graphs
- scientific article; zbMATH DE number 2044931
- Star forests, dominating sets and Ramsey-type problems
- Acyclic, star, and injective colouring: bounding the diameter
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (4)
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)
