On the b-coloring of P4-tidy graphs
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. 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 i...
Guardado en:
| Autores principales: | Velasquez, C.I.B., Bonomo, F., Koch, I. |
|---|---|
| Formato: | Artículo publishedVersion |
| Publicado: |
2011
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n1_p60_Velasquez https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v159_n1_p60_Velasquez_oai |
| Aporte de: |
Ejemplares similares
Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al.
Publicado: (2011)
por: Bonomo, F., et al.
Publicado: (2011)
Ejemplares similares
-
On the b-coloring of P4-tidy graphs
por: Velasquez, C.I.B., et al.
Publicado: (2011) -
On the b-coloring of P4-tidy graphs
por: Velasquez, C.I.B., et al. -
On the b-coloring of P4-tidy graphs
por: Bonomo, Flavia, et al.
Publicado: (2011) -
On the b-coloring of cographs and P 4-sparse graphs
por: Bonomo, F., et al. -
On the b-coloring of cographs and P 4-sparse graphs
Publicado: (2009)