An upper bound on adaptable choosability of graphs (Q1003583)

From MaRDI portal
Revision as of 16:45, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound on adaptable choosability of graphs
scientific article

    Statements

    An upper bound on adaptable choosability of graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references