A refinement of choosability of graphs (Q2284741)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7151500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A refinement of choosability of graphs |
scientific article; zbMATH DE number 7151500 |
Statements
A refinement of choosability of graphs (English)
0 references
15 January 2020
0 references
\(\lambda\)-assignment
0 references
\(\lambda\)-choosability
0 references
signed graph
0 references
generalized signed graph
0 references
planar graphs
0 references
0 references
0 references
0 references
0.8572546243667603
0 references
0.8464892506599426
0 references
0.8458311557769775
0 references
0.8209848403930664
0 references
0.8095038533210754
0 references
