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 χb(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is called b-continuous if it...
Guardado en:
| Autor principal: | Bonomo, Flavia |
|---|---|
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8596LNCS_n_p100_Bonomo http://hdl.handle.net/20.500.12110/paper_03029743_v8596LNCS_n_p100_Bonomo |
| Aporte de: |
Ejemplares similares
-
b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
por: Bonomo, F., et al. -
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
Publicado: (2015) -
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
por: Bonomo, F., et al. -
On the b-coloring of P4-tidy graphs
por: Bonomo, Flavia, et al.
Publicado: (2011) -
On the b-coloring of P4-tidy graphs
por: Velasquez, C.I.B., et al.
Publicado: (2011)