Article Dans Une Revue The Australasian Journal of Combinatorics Année : 2017

A note on Grundy colorings of central graphs

Résumé

A Grundy coloring of a graph G is a proper vertex coloring of G where any vertex x, colored with c(x), has a neighbor of any color 1,2,...,c(x)-1. A central graph G^c is obtained from G by adding an edge between any two non adjacent vertices in G and subdividing any edge of G once. In this note we focus on Grundy colorings of central graphs. We present some bounds related to parameters of G and a Nordhaus-Gaddum inequality. We also determine exact values for the Grundy coloring of some central classical graphs.

Fichier principal
Vignette du fichier
NoteOnGrundyColoringsOfCentralGraphs.pdf (138.23 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01528755 , version 1 (29-05-2017)

Licence

Identifiants

  • HAL Id : hal-01528755 , version 1

Citer

Brice Effantin. A note on Grundy colorings of central graphs. The Australasian Journal of Combinatorics, 2017, 68 (3), pp.346-356. ⟨hal-01528755⟩
483 Consultations
407 Téléchargements

Partager

  • More