The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 19:43, 30 January 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