b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is called b-continuous i...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Bonomo, Flavia, Schaudt, Oliver, Stein, Maya, Valencia-Pabon, Mario
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 10.01.2014
Subjects:	Algorithms Color Coloring Computing time Dynamic programming Graph theory Graphs Polynomials Stability Stability augmentation Trees (mathematics)
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!