2013/04/23 by Xin Zhang, Zhang, Xin
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1304.6266
arxiv created 2013/04/23 · openalex publication_date 2013/04/23 · arxiv updated 2013/04/24 · 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. It is proved that every pseudo-outerplanar graph with maximum degree Δ≥ 5 is totally (Δ+1)-choosable.