Edge-coloring of plane multigraphs with many colors on facial cycles (Q2185732)

This paper relaxes the definition of \(p\)-arboricity for plane graphs in the sense that the requirement is not for all cycles but only for facial cycles and shows that the smallest number of colors needed for such a coloring called facial \(p\)-arboricity is a constant depending on \(p\) only, which is a significant difference between the facial \(p\)-arboricity and the \(p\)-arboricity.