Hardness of computing clique number and chromatic number for Cayley graphs (Q518185)

From MaRDI portal
Revision as of 14:53, 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
Hardness of computing clique number and chromatic number for Cayley graphs
scientific article

    Statements

    title
    Hardness of computing clique number and chromatic number for Cayley graphs (English)
    0 references
    author
    Brendan Rooney
    0 references
    Chris D. Godsil
    0 references
    publication date
    28 March 2017
    0 references
    Mathematics Subject Classification ID
    05C25
    0 references
    05C15
    0 references
    05C69
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6697634
    0 references
    zbMATH Keywords
    quotient graphs
    0 references
    Goppa codes
    0 references
    OpenAlex ID
    W2962874215
    0 references
    arXiv ID
    1502.00965
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q518185&oldid=36312319"
    Powered by MediaWiki