Maximizing <i>H</i>‐Colorings of a Regular Graph (Q4920651)

From MaRDI portal
Revision as of 11:24, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6164622
Language Label Description Also known as
English
Maximizing <i>H</i>‐Colorings of a Regular Graph
scientific article; zbMATH DE number 6164622

    Statements

    title
    Maximizing <i>H</i>‐Colorings of a Regular Graph (English)
    0 references
    DOI
    10.1002/jgt.21658
    0 references
    author
    David Galvin
    0 references
    publication date
    21 May 2013
    0 references
    zbMATH DE Number
    6164622
    0 references
    zbMATH Keywords
    graph homomorphisms
    0 references
    graph coloring
    0 references
    OpenAlex ID
    W1910126432
    0 references
    arXiv ID
    1110.3758
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4920651&oldid=35333140"
    Powered by MediaWiki