Showing cs.DMShow all
2 papers · 1 filter
cs.DM2010
A characterization of b-perfect graphs
Chinh T. Hoàng, Frédéric Maffray, Meriem Mechebbek
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a g…
cs.DM2007
On b-perfect chordal graphs
Frédéric Maffray, Meriem Mechebbek
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…