The distinguishing chromatic number of Cartesian products of two complete graphs
type: Item
instance of: scholarly article
title: The distinguishing chromatic number of Cartesian products of two complete graphs
zbMATH Open document ID: 1222.05225
author: Janja Jerebic
author: Sandi Klavžar
published in: Discrete Mathematics
publication date: 2010-05-28T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5713541
zbMATH Keywords: distinguishing chromatic number
zbMATH Keywords: graph automorphism
zbMATH Keywords: Cartesian product of graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2009.11.021
OpenAlex ID: W1993361990
cites work: Distinguishing Cartesian powers of graphs
cites work: Symmetry breaking in graphs
cites work: The distinguishing number of the hypercube
cites work: The distinguishing number of the direct product and wreath product action.
cites work: On computing the distinguishing numbers of trees and forests
cites work: Distinguishing Chromatic Number of Cartesian Products of Graphs
cites work: The distinguishing chromatic number
cites work: Distinguishing colorings of Cartesian products of complete graphs
cites work: Q5574690
cites work: The distinguishing number of Cartesian products of complete graphs
cites work: Q4523707
cites work: Distinguishing infinite graphs
cites work: Distinguishing labellings of group action on vector spaces and graphs
cites work: Cartesian powers of graphs can be distinguished by two labels
cites work: On distinquishing numbers
cites work: The Automorphism Group of a Product of Graphs
cites work: Graphs with Given Group and Given Graph-Theoretical Properties
cites work: Distinguishability of locally finite trees
DOI: 10.1016/J.DISC.2009.11.021
description: scientific article; zbMATH DE number 5713541