Skip to Main content Skip to Navigation
Journal articles

Facial non-repetitive edge-colouring of plane graphs

Frédéric Havet 1 Stanislav Jendrol' 2 Roman Sotak 2 Erika Skrabulakova 2
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : A sequence r1, r2, ..., r2n such that ri=rn+ i for all 1≤i≤n is called a repetition. A sequence S is called non-repetitive if no block (i.e. subsequence of consecutive terms of S) is a repetition. Let G be a graph whose edges are colored. A trail is called non-repetitive if the sequence of colors of its edges is non-repetitive. If G is a plane graph, a facial non-repetitive edge-coloring of G is an edge-coloring such that any facial trail (i.e. a trail of consecutive edges on the boundary walk of a face) is non-repetitive. We denote π′f(G) the minimum number of colors of a facial non-repetitive edge-coloring of G. In this article, we show that π′f(G)≤8 for any plane graph G. We also get better upper bounds for π′f(G) in the cases when G is a tree, a plane triangulation, a simple 3-connected plane graph, a hamiltonian plane graph, an outerplanar graph or a Halin graph. The bound 4 for trees is tight.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Frederic Havet <>
Submitted on : Sunday, October 23, 2016 - 4:22:30 PM
Last modification on : Wednesday, October 14, 2020 - 4:24:15 AM


Files produced by the author(s)




Frédéric Havet, Stanislav Jendrol', Roman Sotak, Erika Skrabulakova. Facial non-repetitive edge-colouring of plane graphs. Journal of Graph Theory, Wiley, 2011, 66 (1), pp.38--48. ⟨10.1002/jgt.20488⟩. ⟨inria-00638439⟩



Record views


Files downloads