The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2009.11.021 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2009.11.021 / rank | |||
Normal rank | |||
Latest revision as of 10:43, 10 December 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
