Distinguishing Cartesian products of countable graphs (Q503675)

From MaRDI portal
Revision as of 07:31, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    OpenAlex ID
    W2418670818
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q503675&oldid=36301755"
    Powered by MediaWiki