Author:
Masih Zoia,Zaker Manouchehr
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Bondy, A.J., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)
2. Bonomo, F., Duran, G., Maffray, F., Marenco, J., Valencia-Pabon, M.: On the b-coloring of cographs and $$P_4$$-sparse graphs. Graphs Combin. 25, 1–15 (2009)
3. Bonomo, F., Schaudt, O., Stein, M., Valencia-Pabon, M.: b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Algorithmica 73, 289–305 (2015)
4. Cameron, P.J.: Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge (1994)
5. Corteel, S., Valencia-Pabon, M., Vera, J.C.: On approximating the b-chromatic number. Disc. Appl. Math. 146, 106–110 (2005)