The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The distinguishing chromatic number of Cartesian products of two complete graphs |
scientific article; zbMATH DE number 5713541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The distinguishing chromatic number of Cartesian products of two complete graphs |
scientific article; zbMATH DE number 5713541 |
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
0.9160550832748412
0 references
0.8967416286468506
0 references
0.8825426697731018
0 references
0.8735057711601257
0 references
