On edge-group choosability of graphs

Details On edge-group choosability of graphs On edge-group choosability of graphs

2011-06-06

arxiv.org/abs/1106.1110v1

Mathematics

Combinatorics

Scientific paper

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our claim are graphs with maximum degree less than 4, planar graphs with maximum degree at least 11, planar graphs without small cycles, outerplanar graphs and near-outerplanar graphs.

Affiliated with

Also associated with

No associations

Rating

On edge-group choosability of graphs 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 On edge-group choosability of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On edge-group choosability of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-390377