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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 21:53, 30 January 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