Bounds on the distinguishing chromatic number
From MaRDI portal
Publication:2380243
zbMath1186.05051MaRDI QIDQ2380243
Ann N. Trenk, Karen L. Collins, Mark A. Hovey
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224898
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Improving upper bounds for the distinguishing index, Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group, Nordhaus-Gaddum theorem for the distinguishing chromatic number, Distinguishing graphs by edge-colourings, Distinguishing chromatic numbers of complements of Cartesian products of complete graphs, Proper distinguishing colorings with few colors for graphs with girth at least 5, Distinguishing chromatic number of random Cayley graphs, The distinguishing number and distinguishing chromatic number for posets, On the local distinguishing chromatic number