Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable (Q6072035)
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 5-cycles adjacent to 6-cycles is DP-4-colorable |
scientific article; zbMATH DE number 7771726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable |
scientific article; zbMATH DE number 7771726 |
Statements
29 November 2023
0 references
DP-coloring
0 references
planar graphs without \(k\)-cycles
0 references
0 references
0 references
0.9562431573867798
0 references
0.9454087018966676
0 references
0.9445210099220276
0 references
0.9237431287765504
0 references
0.9159038066864014
0 references
