List total coloring of pseudo-outerplanar graphs

From MaRDI portal




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 Deltageq 5 is totally (Delta+1)-choosable.









This page was built for publication: List total coloring of pseudo-outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393451)