A linear-time algorithm for clique-coloring planar graphs (Q2294308)

From MaRDI portal
Revision as of 01:35, 27 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128095046, #quickstatements; #temporary_batch_1724714018853)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear-time algorithm for clique-coloring planar graphs
scientific article

    Statements

    title
    A linear-time algorithm for clique-coloring planar graphs (English)
    0 references
    author
    Zuosong Liang
    0 references
    Erfang Shan
    0 references
    Huiyu Xing
    0 references
    Chun-song Bai
    0 references
    publication date
    10 February 2020
    0 references
    zbMATH Keywords
    graph
    0 references
    clique-coloring
    0 references
    planar graph
    0 references
    linear-time algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C15
    0 references
    05C10
    0 references
    05C69
    0 references
    zbMATH DE Number
    7165785
    0 references
    OpenAlex ID
    W2933542871
    0 references
    Wikidata QID
    Q128095046
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2294308&oldid=37634941"
    Powered by MediaWiki