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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
Proper distinguishing colorings with few colors for graphs with girth at least 5 ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ Improving upper bounds for the distinguishing index ⋮ Distinguishing graphs by edge-colourings ⋮ Distinguishing chromatic number of random Cayley graphs ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ On the local distinguishing chromatic number ⋮ Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group ⋮ The distinguishing number and distinguishing chromatic number for posets
This page was built for publication: Bounds on the distinguishing chromatic number
