Planar Graphs with the Distance of 6^--Cycles at Least 2 from Each Other Are DP-3-Colorable

DP-coloring as a generalization of list coloring was introduced by Dvořák and Postle recently. In this paper, we prove that every planar graph in which the distance between 6<inline-formula><math display="inline"><semantics><msup><mrow></mrow><mo>−</mo></msup></semantics></math></inline-formula>-cyc...

Descrizione completa

Dettagli Bibliografici

Autori principali:	Yueying Zhao, Lianying Miao
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	MDPI AG 2020-12-01
Serie:	Mathematics
Soggetti:	planar graphs DP-coloring discharging method
Accesso online:	https://www.mdpi.com/2227-7390/9/1/70
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!