On the b-coloring of P4-tidy graphs

A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic number of a graph G, denoted by χb(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is b-continuous if it admits a b-coloring with t colors, for every t = χ(G), . . . , χb(G), and it is b-monotonic if χb(H1) ≥ χb(H2) for every

• Type: Journal
• Year: 2011
• Where: DAM
• Authors: Clara Inés Betancur Velasquez, Flavia Bonomo, Ivo Koch
• Keywords: B-chromatic Number, Color Class, DAM 2011, Maximum Number, Theoretical Computer Science