List total coloring of pseudo-outerplanar graphs

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 Δ ≥ 5 is totally (Δ + 1)-choosable. © 2013 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Zhang, X. (2013). List total coloring of pseudo-outerplanar graphs. Discrete Mathematics, 313(20), 2297–2306. https://doi.org/10.1016/j.disc.2013.06.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free