Edge (m,k)-choosability of graphs (Q5057728)
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 7633897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge (m,k)-choosability of graphs |
scientific article; zbMATH DE number 7633897 |
Statements
Edge (m,k)-choosability of graphs (English)
0 references
19 December 2022
0 references
choosability
0 references
vertex \((n,k)\)-choosability
0 references
vertex choice number of \(G\)
0 references
edge \((m,k)\)-choosability
0 references
edge choice number of \(G\)
0 references
0.8085923194885254
0 references
0.7737988829612732
0 references
0.7736360430717468
0 references
0.771035373210907
0 references
