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. 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 is .
This page was built for publication: 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 Q6227311)
