Choosability with separation of planar graphs without prescribed cycles (Q2284787)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Choosability with separation of planar graphs without prescribed cycles
scientific article

    Statements

    Choosability with separation of planar graphs without prescribed cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    choosability with separation
    0 references
    planar graphs
    0 references
    list coloring
    0 references
    adjacent cycles
    0 references
    0 references