On b-perfect Chordal Graphs
Copyright policy )On b-perfect Chordal Graphs
The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Extremal problems in graph theory, Perfect graphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], chordal graphs, forbidden subgraph, 004, 510, Coloring of graphs and hypergraphs, b-coloring, Computer Science - Discrete Mathematics
Extremal problems in graph theory, Perfect graphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], chordal graphs, forbidden subgraph, 004, 510, Coloring of graphs and hypergraphs, b-coloring, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!