3-facial colouring of plane graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Discrete Mathematics Year : 2008

3-facial colouring of plane graphs


A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially 11-colourable. As a consequence, we derive that every 2-connected plane graph with maximum face-size at most 7 is cyclically 11-colourable. These two bounds are for one off from those that are proposed by the (3l+1)-Conjecture and the Cyclic Conjecture.
Fichier principal
Vignette du fichier
HSS08.pdf (169.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00083533 , version 1 (02-07-2006)
inria-00083533 , version 2 (04-07-2006)
inria-00083533 , version 3 (07-07-2006)
inria-00083533 , version 4 (30-06-2010)



Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski. 3-facial colouring of plane graphs. SIAM Journal on Discrete Mathematics, 2008, 22 (1), pp.231--247. ⟨10.1137/060664124⟩. ⟨inria-00083533v4⟩
208 View
235 Download



Gmail Facebook X LinkedIn More