On some domination colorings of graphs
From MaRDI portal
Publication:2399288
DOI10.1016/J.DAM.2017.06.013zbMath1368.05042OpenAlexW2736906274MaRDI QIDQ2399288
Guillaume Bagan, Hamamache Kheddouci, Houcine Boumediene Merouane, Mohammed Haddad
Publication date: 22 August 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.013
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Dominated and dominator colorings over (edge) corona and hierarchical products ⋮ Dominator coloring and CD coloring in almost cluster graphs ⋮ On the algorithmic aspects of strong subcoloring ⋮ On strict strong coloring of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dominator colorings in graphs
- Dominator colorings in some classes of graphs
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Dominating sets for split and bipartite graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- A strict strong coloring of trees
- A tree representation for \(P_ 4\)-sparse graphs
- A linear algorithm for the domination number of a tree
- Treewidth. Computations and approximations
- Relations between the lower domination parameters and the chromatic number of a graph.
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Dominated colorings of graphs
- An algorithm for the dominator chromatic number of a tree
- Total dominator colorings and total domination in graphs
- On the dominator coloring in proper interval graphs and block graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- On the dominator colorings in trees
- Algorithmic Aspects of Dominator Colorings in Graphs
- Easy problems for tree-decomposable graphs
- On the Algorithmic Complexity of Total Domination
- Edge Dominating Sets in Graphs
- The NP-Completeness of Edge-Coloring
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Paths, Trees, and Flowers
- A new kind of graph coloring
This page was built for publication: On some domination colorings of graphs
