The distinguishing chromatic number of Kneser graphs

zbMath1266.05026MaRDI QIDQ1953404

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

zbMATH Keywords

Kneser graphsdistinguishing numberdistinguishing chromatic numberproper coloring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items

Equitable distinguishing chromatic number ⋮ Upper bounds on the locating chromatic number of trees ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group