On b-perfect chordal graphs

Details On b-perfect chordal graphs On b-perfect chordal graphs

2007-11-26

arxiv.org/abs/0711.3959v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On b-perfect chordal graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On b-perfect chordal graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On b-perfect chordal graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170478