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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Koch, Ivo
Publicado: 2011
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v159_n1_p60_Velasquez
http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n1_p60_Velasquez
Aporte de:

Ejemplares similares