On the dominator colorings in trees
From MaRDI portal
Publication:2866414
Recommendations
Cited in
(24)- On dominated coloring of graphs and some Nordhaus–Gaddum-type relations
- Domination and dominator colorings in planar graphs with small diameter
- Dominator coloring and CD coloring in almost cluster graphs
- Dominator coloring of Mycielskian graphs
- A note on global dominator coloring of graphs
- Linear time algorithm for dominator chromatic number of trestled graphs
- A lower bound of the cd-chromatic number and its complexity
- Dominator colorings of certain Cartesian products of paths and cycles
- Dominator and total dominator colorings in graphs
- Chromatic transversal Roman domination in graphs
- On the double total dominator chromatic number of graphs
- An algorithm for the dominator chromatic number of a tree
- Dominated colorings of graphs
- Total dominator colorings and total domination in graphs
- On some domination colorings of graphs
- Compelling colorings: a generalization of the dominator chromatic number
- Extremal problems on detectable colorings of trees
- On dominator colorings in graphs
- On an extremal problem for colored trees
- Global dominator coloring of unicyclic graphs
- Dominator coloring changing and stable graphs upon vertex removal
- Dominated and dominator colorings over (edge) corona and hierarchical products
- On the dominator coloring in proper interval graphs and block graphs
- Global dominator coloring of graphs
This page was built for publication: On the dominator colorings in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866414)