A note on the not 3-choosability of some families of planar graphs (Q845679)

From MaRDI portal
Revision as of 02:22, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A note on the not 3-choosability of some families of planar graphs
scientific article

    Statements

    A note on the not 3-choosability of some families of planar graphs (English)
    0 references
    29 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    coloring
    0 references
    list-coloring
    0 references
    choosability
    0 references