Distinguishing Chromatic Number of Cartesian Products of Graphs

DOI10.1137/060651392zbMath1216.05030OpenAlexW2154008353MaRDI QIDQ3084214

Jeong Ok Choi, Hemanshu Kaul, Stephen G. Hartke

Publication date: 15 March 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/24cd60ed0f02bf3384def4fe27c595da976df67b

zbMATH Keywords

graph coloringsymmetry breakingCartesian product of graphsgraph automorphismdistinguishing numberdistinguishing chromatic number

Mathematics Subject Classification ID

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

Related Items

Proper distinguishing colorings with few colors for graphs with girth at least 5 ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs ⋮ Improving upper bounds for the distinguishing index ⋮ Upper bounds on the locating chromatic number of trees ⋮ Distinguishing graphs by edge-colourings ⋮ The distinguishing number of the augmented cube and hypercube powers ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group