Split and non-split dominator chromatic numbers

MaRDI QIDQ2797428zbMATH OpenFDO

Authors K. Kavitha, N. G. David

Publication date 5 April 2016

Published in Ultra Scientist of Physical Sciences. Section A (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Coloring and domination in graphs
• Dominator and total dominator colorings in graphs
• Total dominator chromatic number of a graph
• On dominator colorings in graphs
• Compelling colorings: a generalization of the dominator chromatic number

Cited in

(6)

• Dichromatic number and forced subdivisions
• Variations of graph coloring, domination, and combinations of both: a brief survey
• Coloring and domination in graphs
• Combinatorics for the dominating and unsplitting numbers
• Power dominator chromatic numbers of splitting graphs of certain classes of graphs
• Dominator sum coloring algorithm for comb-double comb graph

This page was built for publication: Split and non-split dominator chromatic numbers

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