The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.11.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993361990 / rank | |||
Normal rank | |||
Revision as of 20:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The distinguishing chromatic number of Cartesian products of two complete graphs |
scientific article |
Statements
The distinguishing chromatic number of Cartesian products of two complete graphs (English)
0 references
28 May 2010
0 references
distinguishing chromatic number
0 references
graph automorphism
0 references
Cartesian product of graphs
0 references
