On group choosability of total graphs

Details On group choosability of total graphs On group choosability of total graphs

2011-05-25

arxiv.org/abs/1105.4940v1

Mathematics

Combinatorics

Scientific paper

In this paper, we study the group and list group colorings of total graphs and we give two group versions of the total and list total colorings conjectures. We establish the group version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs without certain small cycles, outerplanar and near-outerplanar graphs. In addition, the group version of the list total coloring conjecture is established for forests, outerplanar graphs and graphs with maximum degree at most two.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190917