Linear time algorithm for dominator chromatic number of trestled graphs
From MaRDI portal
Publication:5207500
DOI10.1142/S1793830919500666zbMath1427.05084OpenAlexW2974530346MaRDI QIDQ5207500
S. Arumugam, K. Raja Chandrasekar
Publication date: 2 January 2020
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830919500666
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- On dominator colorings in graphs
- Dominator colorings in some classes of graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- Dominator colorings of products of graphs
- Total dominator colorings and total domination in graphs
- Dominator colorings of certain Cartesian products of paths and cycles
- On the dominator coloring in proper interval graphs and block graphs
- On the dominator colorings in trees
- Algorithmic Aspects of Dominator Colorings in Graphs
- EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS
- The Private Neighbor Cube