Pages that link to "Item:Q659760"
From MaRDI portal
The following pages link to Dominator colorings in some classes of graphs (Q659760):
Displaying 21 items.
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Dominated colorings of graphs (Q2345536) (← links)
- An algorithm for the dominator chromatic number of a tree (Q2352347) (← links)
- Total dominator colorings and total domination in graphs (Q2354609) (← links)
- Dominator colorings of certain Cartesian products of paths and cycles (Q2361078) (← 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)
- Global dominating sets in minimum coloring (Q2920893) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- Dominator and Total Dominator Colorings in Graphs (Q3384111) (← links)
- The dominated chromatic number of middle graphs (Q5045265) (← links)
- Dominator and total dominator coloring of circulant graph <i>C<sub>n</sub></i>(1, 2) (Q5059595) (← links)
- A note on dominator chromatic number of line graph and jump graph of some graphs (Q5085702) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- A note on global dominator coloring of graphs (Q5101885) (← links)
- Total dominator chromatic number of a graph (Q5134334) (← links)
- Linear time algorithm for dominator chromatic number of trestled graphs (Q5207500) (← links)
- (Q5377027) (← 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)
