A characterization of b-chromatic and partial Grundy numbers by induced subgraphs

1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : Gyárfás et al. and Zaker have proven that the Grundy number of a graph $G$ satisfies $\Gamma(G)\ge t$ if and only if $G$ contains an induced subgraph called a $t$-atom. The family of $t$-atoms has bounded order and contains a finite number of graphs. In this article, we introduce equivalents of $t$-atoms for b-coloring and partial Grundy coloring. This concept is used to prove that determining if $\varphi(G)\ge t$ and $\partial\Gamma(G)\ge t$ (under conditions for the b-coloring), for a graph $G$, is in XP with parameter $t$. We illustrate the utility of the concept of $t$-atoms by giving results on b-critical vertices and edges, on b-perfect graphs and on graphs of girth at least $7$.
Type de document :
Article dans une revue
Discrete Mathematics, Elsevier, 2016, 339 (8)

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01157902
Contributeur : Nicolas Gastineau <>
Soumis le : jeudi 28 avril 2016 - 19:09:11
Dernière modification le : samedi 30 avril 2016 - 01:06:36
Document(s) archivé(s) le : mardi 15 novembre 2016 - 17:38:30

Fichiers

bchromv6.haltex.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

• HAL Id : hal-01157902, version 2
• ARXIV : 1505.07780

Citation

Brice Effantin, Nicolas Gastineau, Olivier Togni. A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Discrete Mathematics, Elsevier, 2016, 339 (8). <hal-01157902v2>

Consultations de
la notice

186

Téléchargements du document