Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
scientific article

    Statements

    Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (English)
    0 references
    0 references
    0 references
    8 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-coloring
    0 references
    \(K_5\)-subdivision-free graph
    0 references
    clique-hypergraph
    0 references
    planar graph
    0 references
    polynomial-time algorithm
    0 references
    0 references