Every Planar Graph with the Distance of 5<sup>−</sup>-Cycles at Least 3 from Each Other Is DP-3-Colorable
DP-coloring was introduced by Dvořák and Postle [J. Comb. Theory Ser. B 2018, 129, 38–54]. In this paper, we prove that every planar graph in which the 5<inline-formula><math display="inline"><semantics><msup><mrow></mrow><mo>−</mo></msup></semantics></math></inline-formula>-cycles are at distance o...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
MDPI AG
2020-11-01
|
| Rangatū: | Mathematics |
| Ngā marau: | |
| Urunga tuihono: | https://www.mdpi.com/2227-7390/8/11/1920 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|