The following pages link to Dominated colorings of graphs (Q2345536):
Displayed 17 items.
- On cd-coloring of trees and co-bipartite graphs (Q831718) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Dominated and dominator colorings over (edge) corona and hierarchical products (Q2660830) (← links)
- On the dominated chromatic number of certain graphs (Q4997222) (← links)
- Introduction to dominated edge chromatic number of a graph (Q5004071) (← links)
- The dominated chromatic number of middle graphs (Q5045265) (← links)
- On dominated coloring of graphs and some Nordhaus–Gaddum-type relations (Q5742792) (← links)
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes (Q5859496) (← links)
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs (Q6102271) (← links)
- On CD-chromatic number and its lower bound in some classes of graphs (Q6124431) (← links)
- Dominator coloring and CD coloring in almost cluster graphs (Q6138994) (← links)
- (Q6150894) (← links)
- Dominated coloring in product graphs (Q6181333) (← links)