Complexity of total dominator coloring in graphs
From MaRDI portal
Publication:6184152
DOI10.1007/s00373-023-02726-9zbMath1529.05064arXiv2303.01746OpenAlexW4389069466MaRDI QIDQ6184152
Kaustav K. Paul, Kusum, Michael A. Henning, Arti Pandey
Publication date: 5 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.01746
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dominator colorings in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Total dominator colorings and total domination in graphs
- On a property of the class of n-colorable graphs
- Algorithmic Aspects of Dominator Colorings in Graphs
- Dominator and Total Dominator Colorings in Graphs
- Total Domination in Graphs
- Total dominator coloring of circulant graphs $C_n(a,b)$
- Domination in Graphs: Core Concepts
- Total dominator chromatic number of a graph
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Total dominator chromatic number and Mycieleskian graphs
This page was built for publication: Complexity of total dominator coloring in graphs
