The distinguishing chromatic number of Kneser graphs
From MaRDI portal
Publication:1953404
Recommendations
- The list distinguishing number of Kneser graphs
- Using determining sets to distinguish Kneser graphs
- The distinguishing chromatic number of line graphs of complete graphs
- Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
- Bounds on the distinguishing chromatic number
Cited in
(14)- Upper bounds on the locating chromatic number of trees
- The list distinguishing number of Kneser graphs
- Using determining sets to distinguish Kneser graphs
- On the distinguishing chromatic number of the Kronecker products of graphs
- Bounds on the distinguishing chromatic number
- The determining number and cost of 2-distinguishing of select Kneser graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- scientific article; zbMATH DE number 4214034 (Why is no real title available?)
- scientific article; zbMATH DE number 1043908 (Why is no real title available?)
- Total dominator chromatic number of Kneser graphs
- Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
- On the chromatic number of a subgraph of the Kneser graph
- The distinguishing chromatic number of line graphs of complete graphs
- Equitable distinguishing chromatic number
This page was built for publication: The distinguishing chromatic number of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953404)