On some domination colorings of graphs
From MaRDI portal
Publication:2399288
Recommendations
- On dominator colorings in graphs
- Dominator colorings in some classes of graphs
- Dominated colorings of graphs
- Coloring and domination in graphs
- Dominator and total dominator colorings in graphs
- scientific article; zbMATH DE number 2170484
- Domination in colored complete graphs
- On the \(b\)-dominating coloring of graphs
- On the dominated chromatic number of certain graphs
- Total dominator colorings and total domination in graphs
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A linear algorithm for the domination number of a tree
- A linear kernel for planar total dominating set
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- A new kind of graph coloring
- A strict strong coloring of trees
- A tree representation for \(P_ 4\)-sparse graphs
- Algorithmic aspects of dominator colorings in graphs
- An algorithm for the dominator chromatic number of a tree
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Dominated colorings of graphs
- Dominating sets for split and bipartite graphs
- Dominator colorings and safe clique partitions
- Dominator colorings in some classes of graphs
- Easy problems for tree-decomposable graphs
- Edge Dominating Sets in Graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1384868 (Why is no real title available?)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- On dominator colorings in graphs
- On the Algorithmic Complexity of Total Domination
- On the dominator coloring in proper interval graphs and block graphs
- On the dominator colorings in trees
- Paths, Trees, and Flowers
- Relations between the lower domination parameters and the chromatic number of a graph.
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The NP-Completeness of Edge-Coloring
- Total dominator colorings and total domination in graphs
- Treewidth. Computations and approximations
Cited in
(23)- On the algorithmic aspects of strong subcoloring
- Factor d-domatic colorings of graphs
- On the \(b\)-dominating coloring of graphs
- Dominated and dominator colorings over (edge) corona and hierarchical products
- Dominating coloring number of claw-free graphs
- Some results on incidence coloring, star arboricity and domination number
- scientific article; zbMATH DE number 7295283 (Why is no real title available?)
- Domination in transitive colorings of tournaments
- On global dominating -X-coloring of graphs
- On strict strong coloring of graphs
- Domination and dominator coloring of neighborhood corona of certain graphs
- scientific article; zbMATH DE number 7274066 (Why is no real title available?)
- Dominator coloring and CD coloring in almost cluster graphs
- Domination equitable coloring of graphs
- Dominator colorings in some classes of graphs
- Perfect Italian domination on some generalizations of cographs
- Algorithmic results for weak Roman domination problem in graphs
- Some algorithmic results for eternal vertex cover problem in graphs
- Majority dominator colorings of graphs
- On graphs whose domination number is equal to chromatic and dominator chromatic numbers
- Dominator coloring and CD coloring in almost cluster graphs
- Exploring algorithmic solutions for the independent Roman domination problem in graphs
- Improved bounds on proper conflict-free coloring of graphs
This page was built for publication: On some domination colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399288)
