Abstract
AbstractThis paper proves that every planar graph having no cycle of length 4, 7, or 9 is DP‐3‐colorable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
