2011/08/25 by Xin Zhang, Zhang, Xin, Guizhen Liu +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1108.5009
arxiv created 2011/08/25 · openalex publication_date 2011/08/25 · arxiv updated 2011/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 Δ≥ 5 is Δ+1.