Pages that link to "Item:Q3111637"
From MaRDI portal
The following pages link to Algorithmic Aspects of Dominator Colorings in Graphs (Q3111637):
Displayed 21 items.
- On dominator colorings in graphs (Q351043) (← links)
- On cd-coloring of trees and co-bipartite graphs (Q831718) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- Dominated colorings of graphs (Q2345536) (← links)
- An algorithm for the dominator chromatic number of a tree (Q2352347) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- On the dominator coloring in proper interval graphs and block graphs (Q2788718) (← links)
- The cd-Coloring of Graphs (Q2795960) (← links)
- A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664) (← links)
- Dominator and Total Dominator Colorings in Graphs (Q3384111) (← links)
- On strict strong coloring of graphs (Q5013494) (← links)
- Dominator and total dominator coloring of circulant graph <i>C<sub>n</sub></i>(1, 2) (Q5059595) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- Linear time algorithm for dominator chromatic number of trestled graphs (Q5207500) (← 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)
- Complexity of total dominator coloring in graphs (Q6184152) (← links)
