Chromatic Number: The smallest number of colors needed to color a graph so that no two adjacent vertices share the same color. Clique Number: The size of the largest complete subgraph within a ...

b-Chromatic Number (b(G)): The maximum number of colors used in any color-dominating coloring of a graph. K2,t-Free Graphs: Graphs that do not contain a complete bipartite subgraph with two ...