Total dominator chromatic number of Kneser graphs
From MaRDI portal
Publication:6166235
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).
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
Cites work
- scientific article; zbMATH DE number 1096962 (Why is no real title available?)
- Domination in Kneser graphs
- Kneser's conjecture, chromatic number, and homotopy
- On \(b\)-coloring of the Kneser graphs
- On the locating chromatic number of Kneser graphs
- Total domination in graphs
- Total dominator chromatic number of Mycieleskian graphs
- Total dominator chromatic number of a graph
- Total dominator colorings and total domination in 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)