Dynamic choosability of triangle-free graphs and sparse random graphs (Q4638632)
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 6865380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic choosability of triangle-free graphs and sparse random graphs |
scientific article; zbMATH DE number 6865380 |
Statements
Dynamic choosability of triangle‐free graphs and sparse random graphs (English)
0 references
27 April 2018
0 references
dynamic choosability
0 references
dynamic coloring
0 references
dynamic list coloring
0 references
strong coloring
0 references
0.8040503263473511
0 references
0.7961963415145874
0 references
0.7942743897438049
0 references
0.7862261533737183
0 references
0.7855190634727478
0 references
