Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9303768873214722
0 references
0.9027059674263
0 references
0.8957977890968323
0 references
0.8770277500152588
0 references
0.871630072593689
0 references
