An upper bound on adaptable choosability of graphs (Q1003583): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1112052
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Andre Raspaud / rank
 
Normal rank

Revision as of 06:59, 22 February 2024

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