Distinguishing colorings of Cartesian products of complete graphs

DOI10.1016/j.disc.2007.04.070zbMath1147.05029arXivmath/0607465MaRDI QIDQ2483404

Garth Isaak, Michael J. Fisher

Publication date: 28 April 2008

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

Full work available at URL: https://arxiv.org/abs/math/0607465

zbMATH Keywords

automorphism; edge coloring; distinguishing number

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Improving upper bounds for the distinguishing index, The list distinguishing number equals the distinguishing number for interval graphs, The distinguishing chromatic number of Cartesian products of two complete graphs, Extending precolorings to distinguish group actions, The distinguishing number and distinguishing index of the lexicographic product of two graphs, Precise bounds for the distinguishing index of the Cartesian product, The distinguishing number of Cartesian products of complete graphs, The determining number of a Cartesian product

Cites Work

• Cartesian powers of graphs can be distinguished by two labels
• Identity orientation of complete bipartite graphs
• Symmetry breaking in graphs
• The distinguishing number of Cartesian products of complete graphs
• Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs