This paper proves that every planar graph having no cycle of length 4, 7, or 9 is DP‐3‐colorable.
No takes yet. Share an insight, caveat, or question.
Kang et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: