Total dominator chromatic number of Kneser graphs
From MaRDI portal
Publication:6166235
DOI10.1080/09728600.2023.2170299zbMATH Open1517.05056arXiv2001.00221OpenAlexW2998458775MaRDI QIDQ6166235FDOQ6166235
Authors: Parvin Jalilolghadr, Ali Behtoei 
Publication date: 2 August 2023
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Abstract: In this paper among some other results and by using the existance of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph KG(n,2).
Full work available at URL: https://arxiv.org/abs/2001.00221
Recommendations
- Total dominator chromatic number of a graph
- Total dominator chromatic number of k-subdivision of graphs
- Chromatic numbers of Kneser-type graphs
- Total dominator chromatic number of Mycieleskian graphs
- On chromatic number of general Kneser graphs
- Chromatic total domination in graphs
- Total \(k\)-domination number in graphs
- The Chromatic Number of Kneser Hypergraphs
- On the chromatic number of the general Kneser-graph
- The distinguishing chromatic number of Kneser graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Total domination in graphs
- Kneser's conjecture, chromatic number, and homotopy
- On the locating chromatic number of Kneser graphs
- Title not available (Why is that?)
- On \(b\)-coloring of the Kneser graphs
- Total dominator colorings and total domination in graphs
- Total dominator chromatic number of a graph
- Domination in Kneser graphs
- Total dominator chromatic number of Mycieleskian graphs
Cited In (2)
This page was built for publication: Total dominator chromatic number of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166235)
