Group edge choosability of planar graphs without adjacent short cycles

Details Group edge choosability of planar graphs without adjacent short cycles Group edge choosability of planar graphs without adjacent short cycles

2011-02-24

arxiv.org/abs/1102.4980v3

Mathematics

Combinatorics

9 pages, a very minor revision to its first version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Group edge choosability of planar graphs without adjacent short cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Group edge choosability of planar graphs without adjacent short cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Group edge choosability of planar graphs without adjacent short cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86606