Abstract
The edge DP-chromatic number of G, denoted by χDP′(G), is the minimum k such that G is edge DP-k-colorable. In 1999, Juvan, Mohar, and Thomas proved that the edge list chromatic number of K4-minor free graph G with Δ≥3 is Δ. In this paper, we prove that if G is a K4-minor free graph, then χDP′(G)∈{Δ,Δ+1}, and equality χDP′(G)=Δ+1 holds for some K4-minor free graph G with Δ=3. Moreover, if G is a planar graph with Δ≥9 and with no intersecting triangles, then χDP′(G)=Δ.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
