Distinguishing Cartesian products of countable graphs (Q503675)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Distinguishing Cartesian products of countable graphs
scientific article

    Statements

    Distinguishing Cartesian products of countable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    0 references
    vertex coloring
    0 references
    distinguishing number
    0 references
    automorphisms
    0 references
    infinite graphs
    0 references
    Cartesian product
    0 references
    weak Cartesian product
    0 references
    0 references