Colour class domination numbers of some classes of graphs

MaRDI QIDQ4982508zbMATH OpenFDO

Authors Venkata Swaminathan, Yanamandram B. Venkatakrishnan

Publication date 9 April 2015

zbMATH Keywords

graph dominationgraph coloring

Mathematics Subject Classification ID

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

Recommendations

• Dominator and total dominator colorings in graphs
• On dominator colorings in graphs
• Dominator chromatic number of certain graph
• Dominator colorings in some classes of graphs
• On the dominator chromatic number of the generalized caterpillars forest

Cited in

(17)

• Domination equitable coloring of graphs
• Power dominator equitable coloring of graphs
• On the algorithmic aspects of strong subcoloring
• The cd-coloring of graphs
• A lower bound of the cd-chromatic number and its complexity
• On the dominator chromatic number of the generalized caterpillars forest
• On the complexity of cd-coloring of graphs
• Power dominator chromatic numbers of splitting graphs of certain classes of graphs
• Dominator chromatic number of certain graph
• Compelling colorings: a generalization of the dominator chromatic number
• On dominator colorings in graphs
• \(X\)-color class domination in bipartite graphs
• On the dominator coloring in proper interval graphs and block graphs
• Dominator colorings in some classes of graphs
• Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes
• Rainbow dominator coloring in graphs
• Global dominator coloring of graphs

This page was built for publication: Colour class domination numbers of some classes of graphs

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