Distinguishing Cartesian products of countable graphs (Q503675)

From MaRDI portal
Revision as of 05:19, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Distinguishing Cartesian products of countable graphs
scientific article

    Statements

    title
    Distinguishing Cartesian products of countable graphs (English)
    0 references
    author
    Ehsan Estaji
    0 references
    Wilfried Imrich
    0 references
    Rafał Kalinowski
    0 references
    Monika Pilśniak
    0 references
    Thomas W. Tucker
    0 references
    publication date
    23 January 2017
    0 references
    zbMATH Keywords
    vertex coloring
    0 references
    distinguishing number
    0 references
    automorphisms
    0 references
    infinite graphs
    0 references
    Cartesian product
    0 references
    weak Cartesian product
    0 references

    Identifiers

    DOI
    10.7151/dmgt.1902
    0 references
    zbMATH DE Number
    6676793
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q503675&oldid=12386431"
    Powered by MediaWiki