Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565)
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 7074923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable |
scientific article; zbMATH DE number 7074923 |
Statements
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (English)
0 references
28 June 2019
0 references
coloring
0 references
list coloring
0 references
DP-coloring
0 references
signed graph
0 references
0 references
0.9846737
0 references
0.95132476
0 references
0.94577324
0 references
0.94482815
0 references
0.93947357
0 references
0.9334569
0 references
0.9332568
0 references
0.93145037
0 references
