Linear time algorithm for dominator chromatic number of trestled graphs

DOI10.1142/S1793830919500666MaRDI QIDQ5207500zbMATH OpenOpenAlexFDO

Authors S. Arumugam, K. Raja Chandrasekar

Publication date 2 January 2020

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830919500666

zbMATH Keywords

dominator coloringproper coloringtotal dominator coloringtrestled graph

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for the dominator chromatic number of a tree
• Dominator and total dominator colorings in graphs
• Algorithmic aspects of dominator colorings in graphs
• Dominator colorings in some classes of graphs
• Total dominator coloring number of middle graphs

Cites work

• Algorithmic aspects of dominator colorings in graphs
• Dominator colorings and safe clique partitions
• Dominator colorings in some classes of graphs
• Dominator colorings of certain Cartesian products of paths and cycles
• Dominator colorings of products of graphs
• Equitable coloring of 2-degenerate graph and plane graphs without cycles of specific lengths
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• On dominator colorings in graphs
• On the dominator coloring in proper interval graphs and block graphs
• On the dominator colorings in trees
• The \(\langle t \rangle \)-property of some classes of graphs
• The Private Neighbor Cube
• Total dominator colorings and total domination in graphs

Cited in

(1)

• scientific article; zbMATH DE number 4063108 (Why is no real title available?)

This page was built for publication: Linear time algorithm for dominator chromatic number of trestled graphs

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