A characterization of b-perfect graphs

Details A characterization of b-perfect graphs A characterization of b-perfect graphs

2010-04-29

arxiv.org/abs/1004.5306v1

Computer Science

Discrete Mathematics

Scientific paper

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 graph $G$ is the largest integer $k$ such that $G$ admits a b-coloring with $k$ colors. A graph is b-perfect if the b-chromatic number is equal to the chromatic number for every induced subgraph of $G$. We prove that a graph is b-perfect if and only if it does not contain as an induced subgraph a member of a certain list of twenty-two graphs. This entails the existence of a polynomial-time recognition algorithm and of a polynomial-time algorithm for coloring exactly the vertices of every b-perfect graph.

Affiliated with

Also associated with

No associations

Rating

A characterization of b-perfect 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 A characterization of b-perfect graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A characterization of b-perfect graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-285262