Bounds on the distinguishing chromatic number

MaRDI QIDQ2380243zbMATH OpenFDO

Authors Karen L. Collins, Ann Trenk, Mark 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, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r88.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

automorphism groupdistinguishing chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Graphs with large distinguishing chromatic number
• χ_D(G), |Aut(G)|, and a variant of the motion lemma
• The distinguishing chromatic number
• Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
• The distinguishing chromatic number of Kneser graphs

Cited in

(18)

• On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
• Proper distinguishing colorings with few colors for graphs with girth at least 5
• Improving upper bounds for the distinguishing index
• A bound on the total chromatic number
• scientific article; zbMATH DE number 5847230 (Why is no real title available?)
• The distinguishing number and distinguishing chromatic number for posets
• The distinguishing chromatic number
• Distinguishing maps
• Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• Graphs with large distinguishing chromatic number
• The distinguishing chromatic number of Kneser graphs
• Distinguishing chromatic numbers of wreath products
• Automorphisms and distinguishing numbers of geometric cliques
• Distinguishing graphs by edge-colourings
• On the local distinguishing chromatic number
• Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
• Distinguishing chromatic number of random Cayley graphs

This page was built for publication: Bounds on the distinguishing chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380243)