On dominator colorings in graphs

DOI10.1007/s12044-012-0092-5zbMath1268.05060OpenAlexW2015832089MaRDI QIDQ351043

K. Raja Chandrasekar, S. Arumugam, Jay S. Bagga

Publication date: 3 July 2013

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-012-0092-5

zbMATH Keywords

chromatic numberdomination numberdominator chromatic numberdominator coloring

Mathematics Subject Classification ID

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

Related Items

Dominator colorings of certain Cartesian products of paths and cycles, On some domination colorings of graphs, On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs, Complexity of total dominator coloring in graphs, Unnamed Item, Global dominator coloring of graphs, On dominated coloring of graphs and some Nordhaus–Gaddum-type relations, Linear time algorithm for dominator chromatic number of trestled graphs, Dominator and Total Dominator Colorings in Graphs, Unnamed Item, Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes, On strict strong coloring of graphs

Cites Work

• Triangle-free graphs whose independence number equals the degree
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Fractional dominations and fractional total dominations of graph complements
• Several parameters of generalized Mycielskians
• Algorithmic Aspects of Dominator Colorings in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item