2000 character limit reached
On b-perfect chordal graphs (0711.3959v1)
Published 26 Nov 2007 in cs.DM
Abstract: The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.