An upper bound on adaptable choosability of graphs (Q1003583)

From MaRDI portal
Revision as of 06:59, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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