The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145)

From MaRDI portal
Revision as of 03:12, 8 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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