Abstract
In this paper, we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group (Δ(G)+1)-edge-choosable, and some planar graphs with large girth and maximum degree are group Δ(G)-edge-choosable.
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
