b-colouring outerplanar graphs - Archive ouverte HAL Accéder directement au contenu
Autre Publication Scientifique Année : 2010

b-colouring outerplanar graphs

Ana Shirley Ferreira da Silva
  • Fonction : Auteur
  • PersonId : 926983
Frédéric Maffray

Résumé

A b-colouring of a graph is a colouring of its vertices such that every colour class contains a vertex that has a neighbour in all other classes. The b- chromatic number of a graph is the largest integer k such that the graph has a b-colouring with k colours. We show here how to compute in polynomial time the b-chromatic number of an outerplanar graph of girth at least 8. This generalizes the seminal result of Irving and Manlove on trees.
Fichier non déposé

Dates et versions

hal-00529165 , version 1 (25-10-2010)

Identifiants

  • HAL Id : hal-00529165 , version 1

Citer

Ana Shirley Ferreira da Silva, Frédéric Maffray. b-colouring outerplanar graphs. 2010. ⟨hal-00529165⟩
94 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More