Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833)

From MaRDI portal
Revision as of 23:45, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Connected Coloring Completion for General Graphs: Algorithms and Complexity
scientific article

    Statements

    title
    Connected Coloring Completion for General Graphs: Algorithms and Complexity (English)
    0 references
    author
    Benny Chor
    0 references
    Michael R. Fellows
    0 references
    Mark A. Ragan
    0 references
    Igor Razgon
    0 references
    Frances A. Rosamond
    0 references
    Sagi Snir
    0 references
    publication date
    6 March 2009
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    92D15
    0 references
    68Q25
    0 references
    68W40
    0 references
    zbMATH DE Number
    5523827
    0 references
    zbMATH Keywords
    algorithms and complexity
    0 references
    bioinformatics
    0 references
    OpenAlex ID
    W1577433976
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3608833&oldid=32240077"
    Powered by MediaWiki