An upper bound on adaptable choosability of graphs (Q1003583)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on adaptable choosability of graphs |
scientific article; zbMATH DE number 5523085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on adaptable choosability of graphs |
scientific article; zbMATH DE number 5523085 |
Statements
An upper bound on adaptable choosability of graphs (English)
0 references
4 March 2009
0 references
0 references
0.91258514
0 references
0 references
0.8973845
0 references
0.8951875
0 references
0.89338946
0 references
0 references
0.88070434
0 references
0.8798722
0 references
