Looseness of Planar Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Graphs and Combinatorics Year : 2011

Looseness of Planar Graphs


A face of a vertex coloured plane graph is called loose if the number of colours used on its vertices is at least three. The looseness of a plane graph G is the minimum k such that any surjective k-colouring involves a loose face. In this paper we prove that the looseness of a connected plane graph G equals the maximum number of vertex disjoint cycles in the dual graph G increased by 2. We also show upper bounds on the looseness of graphs based on the number of vertices, the edge connectivity, and the girth of the dual graphs. These bounds improve the result of Negami for the looseness of plane triangulations. We also present infinite classes of graphs where the equalities are attained.
Fichier principal
Vignette du fichier
CJK_11.pdf (132.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00634940 , version 1 (09-11-2011)



Július Czap, Stanislav Jendrol', František Kardoš, Jozef Miškuf. Looseness of Planar Graphs. Graphs and Combinatorics, 2011, 27 (1), pp.73-85. ⟨10.1007/s00373-010-0961-6⟩. ⟨inria-00634940⟩
125 View
164 Download



Gmail Facebook Twitter LinkedIn More