On the b-coloring of P4-tidy graphs

Mostrar todas las versiones(3)

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: Velasquez, C.I.B., Bonomo, F., Koch, I.
Formato: JOUR
Materias:
b-coloring
b-continuity
b-monotonicity
P4-tidy graphs
B-chromatic number
Chromatic number
Graph G
Induced subgraphs
Monotonicity
Polynomial-time algorithms
Color
Coloring
Graphic methods
Polynomial approximation
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n1_p60_Velasquez
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares