The distinguishing chromatic number of Cartesian products of two complete graphs

DOI10.1016/J.DISC.2009.11.021zbMath1222.05225OpenAlexW1993361990MaRDI QIDQ973145

Janja Jerebic, Sandi Klavžar

Publication date: 28 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.021

zbMATH Keywords

Cartesian product of graphsgraph automorphismdistinguishing chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Equitable distinguishing chromatic number ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs

Cites Work

• On computing the distinguishing numbers of trees and forests
• The distinguishing chromatic number
• Cartesian powers of graphs can be distinguished by two labels
• Distinguishability of locally finite trees
• The distinguishing number of the hypercube
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• The distinguishing number of the direct product and wreath product action.
• Distinguishing labellings of group action on vector spaces and graphs
• Distinguishing Chromatic Number of Cartesian Products of Graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• On distinquishing numbers
• The Automorphism Group of a Product of Graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The distinguishing chromatic number of Cartesian products of two complete graphs