List total coloring of pseudo-outerplanar graphs
Combinatorics
2013-04-24 v1 Discrete Mathematics
Abstract
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. It is proved that every pseudo-outerplanar graph with maximum degree \Delta\geq 5 is totally (\Delta+1)-choosable.
Keywords
Cite
@article{arxiv.1304.6266,
title = {List total coloring of pseudo-outerplanar graphs},
author = {Xin Zhang},
journal= {arXiv preprint arXiv:1304.6266},
year = {2013}
}