A note on Grundy colorings of central graphs

Brice Effantin 1
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : 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.
Type de document :
Article dans une revue
Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2017, 68 (3), pp.346-356. <https://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p346.pdf>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01528755
Contributeur : Brice Effantin <>
Soumis le : lundi 29 mai 2017 - 16:27:11
Dernière modification le : vendredi 2 juin 2017 - 08:25:45

Fichier

NoteOnGrundyColoringsOfCentral...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01528755, version 1

Collections

Citation

Brice Effantin. A note on Grundy colorings of central graphs. Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2017, 68 (3), pp.346-356. <https://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p346.pdf>. <hal-01528755>

Partager

Métriques

Consultations de
la notice

47

Téléchargements du document

26