Total dominator chromatic number of Kneser graphs
From MaRDI portal
Publication:6166235
DOI10.1080/09728600.2023.2170299zbMath1517.05056arXiv2001.00221OpenAlexW2998458775MaRDI QIDQ6166235
Parvin Jalilolghadr, Ali Behtoei
Publication date: 2 August 2023
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00221
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- On the locating chromatic number of Kneser graphs
- On \(b\)-coloring of the Kneser graphs
- Total dominator colorings and total domination in graphs
- Total Domination in Graphs
- Total dominator chromatic number of a graph
- Domination in Kneser graphs
- Total dominator chromatic number and Mycieleskian graphs
This page was built for publication: Total dominator chromatic number of Kneser graphs