Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable |
scientific article |
Statements
Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (English)
0 references
23 April 2020
0 references
DP-coloring
0 references
list coloring
0 references
planar graph
0 references
cycle
0 references
0 references
