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

作者：Effantin Brice; Gastineau Nicolas; Togni Olivier

来源：Discrete Mathematics, 2016, 339(8): 2157-2167.

DOI：10.1016/j.disc.2016.03.011

• Parameterized complexity
• Grundy number
• b-coloring
• Partial Grundy number

Gyarfas et al. and Zaker have proven that the Grundy number of a graph G satisfies Gamma(G) >= 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 phi(G) >= t and partial derivative Gamma(G) >= 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.

• 出版日期2016-8-6