Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable |
scientific article |
Statements
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (English)
0 references
22 January 2019
0 references
DP-coloring
0 references
planar graph
0 references
discharging
0 references
0 references
