Cyclic colorings of plane graphs with independent faces

Simple item page
dc.creatorAzarija, Jernej
dc.creatorKrál', Daniel
dc.creatorErman, Rok
dc.creatorKrnc, Matjaz
dc.creatorStacho, Ladislav
dc.date2008-11-17
dc.date.accessioned2026-07-07T10:18:51Z
dc.date.available2026-07-07T10:18:51Z
dc.descriptionLet 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.
dc.identifierhttps://arxiv.org/abs/0811.2704
dc.identifierhttp://arxiv.org/abs/0811.2704
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174333
dc.subjectCombinatorics
dc.subject05C15 (Primary); 05C10 (Secondary)
dc.titleCyclic colorings of plane graphs with independent faces
dc.typetext

Files

Collections

arXiv