2008/11/17 by Jernej Azarija, Daniel Král͏̌, Daniel Král' +9
Computer Science · Mathematics · #05C10 (Secondary) #05C15 (Primary) #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #math.CO #msc:05C10 #msc:05C15
paper · pdf · doi:10.48550/arxiv.0811.2704
arxiv created 2008/11/17 · openalex publication_date 2008/11/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such that all vertices incident with the same face receive distinct colors.