Dominated colorings of graphs
From MaRDI portal
Publication:2345536
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- A strict strong coloring of trees
- A survey on vertex coloring problems
- Algorithmic aspects of dominator colorings in graphs
- Dominator colorings and safe clique partitions
- Dominator colorings in some classes of graphs
- Every planar map is four colorable
- On the Algorithmic Complexity of Total Domination
- On the dominator colorings in trees
- Relations between the lower domination parameters and the chromatic number of a graph.
- Vertex colorings with a distance restriction
Cited in
(33)- On the complexity of minimum \(q\)-domination partization problems
- Dominated coloring in product graphs
- scientific article; zbMATH DE number 7295283 (Why is no real title available?)
- Domination equitable coloring of graphs
- On cd-coloring of trees and co-bipartite graphs
- scientific article; zbMATH DE number 7057230 (Why is no real title available?)
- On dominated coloring of graphs and some Nordhaus–Gaddum-type relations
- Colored and proper-colored-domination
- Total domination, separated-cluster, CD-coloring: algorithms and hardness
- Domination and dominator coloring of neighborhood corona of certain graphs
- Coloring of graphs associated with commutative rings
- The dominated chromatic number of middle graphs
- Coloring and domination in graphs
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes
- Domination in transitive colorings of tournaments
- On the complexity of cd-coloring of graphs
- Dominated and dominator colorings over (edge) corona and hierarchical products
- Introduction to dominated edge chromatic number of a graph
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
- scientific article; zbMATH DE number 7274066 (Why is no real title available?)
- On some domination colorings of graphs
- Parameterized and exact algorithms for class domination coloring
- Dominator coloring of generalized Petersen graphs
- Approximation algorithm for minimum \(q\)-dominator partization problem
- Chromatic transversal Roman domination in graphs
- Dominator colorings in some classes of graphs
- Dominator coloring and CD coloring in almost cluster graphs
- On the \(b\)-dominating coloring of graphs
- On the number of maximal independent sets in minimum colorings of split graphs
- Algorithmic aspects of dominator colorings in graphs
- On the algorithmic aspects of strong subcoloring
- On the dominated chromatic number of certain graphs
- On CD-chromatic number and its lower bound in some classes of graphs
This page was built for publication: Dominated colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345536)