The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:46, 5 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
    0 references
    0 references
    28 May 2010
    0 references
    0 references
    distinguishing chromatic number
    0 references
    graph automorphism
    0 references
    Cartesian product of graphs
    0 references