Abstract
A graph G is edge- L -colorable, if for a given edge assignment L = { L ( e ) : e ∈ E ( G ) } , there exists a proper edge-coloring ϕ of G such that ϕ ( e ) ∈ L ( e ) for all e ∈ E ( G ) . If G is edge- L -colorable for every edge assignment L with | L ( e ) | ≥ k for e ∈ E ( G ) , then G is said to be edge- k -choosable. In this paper, we prove that if G is a planar graph with maximum degree Δ ( G ) ≠ 5 and without adjacent 3-cycles, or with maximum degree Δ ( G ) ≠ 5 , 6 and without 7-cycles, then G is edge- ( Δ ( G ) + 1 ) -choosable.
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.
