On the complexity of colouring by superdigraphs of bipartite graphs (Q686279)

From MaRDI portal
Revision as of 06:53, 16 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q558237)
scientific article
Language Label Description Also known as
English
On the complexity of colouring by superdigraphs of bipartite graphs
scientific article

    Statements

    title
    On the complexity of colouring by superdigraphs of bipartite graphs (English)
    0 references
    author
    Pavol Hell
    0 references
    Gary MacGillivray
    0 references
    publication date
    14 October 1993
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    68Q25
    0 references
    05C20
    0 references
    68R10
    0 references
    zbMATH DE Number
    428124
    0 references
    zbMATH Keywords
    complexity
    0 references
    colouring
    0 references
    digraph
    0 references
    homomorphism
    0 references
    NP-complete
    0 references
    bipartite graph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q686279&oldid=21501415"
    Powered by MediaWiki