The distinguishing chromatic number of Kneser graphs
zbMATH Open1266.05026MaRDI QIDQ1953404FDOQ1953404
Authors: Zhongyuan Che, Karen L. Collins 
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p23
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cited In (14)
- Title not available (Why is that?)
- Upper bounds on the locating chromatic number of trees
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Equitable distinguishing chromatic number
- Bounds on the distinguishing chromatic number
- The distinguishing chromatic number of line graphs of complete graphs
- On the chromatic number of a subgraph of the Kneser graph
- On the distinguishing chromatic number of the Kronecker products of graphs
- Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
- The list distinguishing number of Kneser graphs
- Using determining sets to distinguish Kneser graphs
- The determining number and cost of 2-distinguishing of select Kneser graphs
- Title not available (Why is that?)
- Total dominator chromatic number of Kneser graphs
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)
