Skip to main content
Article thumbnail
Location of Repository

Group edge choosability of planar graphs without adjacent short cycles

By Xin Zhang and Guizhen Liu


In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group $(\Delta(G)+1)$-edge-choosable while some planar graphs with large girth and maximum degree is group $\Delta(G)$-edge-choosable.Comment: 9 pages, a very minor revision to its first versio

Topics: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, 05C15, 05C20
Year: 2011
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.