Total coloring of pseudo-outerplanar graphs

Details Total coloring of pseudo-outerplanar graphs Total coloring of pseudo-outerplanar graphs

2011-08-25

arxiv.org/abs/1108.5009v1

Mathematics

Combinatorics

Scientific paper

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the total coloring conjecture is completely confirmed for pseudo-outerplanar graphs. In particular, it is proved that the total chromatic number of every pseudo-outerplanar graph with maximum degree $\Delta\geq 5$ is $\Delta+1$.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318701