Coloring bipartite graphs with semi-small list size (Q6065679)
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: Coloring bipartite graphs with semi-small list size |
scientific article; zbMATH DE number 7765573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring bipartite graphs with semi-small list size |
scientific article; zbMATH DE number 7765573 |
Statements
Coloring bipartite graphs with semi-small list size (English)
0 references
15 November 2023
0 references
choosability
0 references
list chromatic number
0 references
independent sets
0 references
0.92683077
0 references
0.92683077
0 references
0.9176048
0 references
0.9156425
0 references
0.91252625
0 references
0.9103934
0 references
0.9100441
0 references
0.9091252
0 references
0.9071646
0 references
0.90428543
0 references
