Fractional DP-chromatic number of planar graphs of large girth
2021
This paper proves that for any integer k ≥ 1, every planar graph G of girth at least 8k − 3 has fractional DP-chromatic number at most 2 + 1 k.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI