On the double total dominator chromatic number of graphs
From MaRDI portal
Publication:5101880
DOI10.1142/S1793830921501548zbMath1493.05094OpenAlexW3179802468MaRDI QIDQ5101880
Walid Marweni, Fairouz Beggas, Hamamache Kheddouci
Publication date: 2 September 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501548
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-tuple total domination in complementary prisms
- Dominator colorings in some classes of graphs
- \(k\)-tuple total domination in graphs
- Multi-colored spanning graphs
- A strict strong coloring of trees
- A survey of selected recent results on total domination in graphs
- \(T\)-colorings of graphs
- Total colourings of planar graphs with large girth
- Relations between the lower domination parameters and the chromatic number of a graph.
- Vertex colorings with a distance restriction
- \(k\)-tuple total domination in cross products of graphs
- Partial list colorings
- A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
- Total dominator chromatic number of some operations on a graph
- Total dominator colorings and total domination in graphs
- On the dominator colorings in trees
- Algorithmic Aspects of Dominator Colorings in Graphs
- Total Domination in Graphs
- A note on dominator chromatic number of line graph and jump graph of some graphs
- Resolving domination number of graphs
- Total dominator chromatic number and Mycieleskian graphs
- Double vertex-edge domination
- A new kind of graph coloring
- Outer-paired domination in graphs
- Edge coloring of bipartite graphs with constraints
This page was built for publication: On the double total dominator chromatic number of graphs
