Minimum order of graphs with given coloring parameters

Abstract

A complete k-coloring of a graph G=(V,E) is an assignment φ:V→{1,…,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic numberχ(G) and achromatic numberψ(G), respectively), and the Grundy numberΓ(G) defined as the largest k admitting a complete coloring φ with exactly k colors such that every vertex v∈V of color φ(v) has a neighbor of color i for all 1≤i<φ(v). The inequality chain χ(G)≤Γ(G)≤ψ(G) obviously holds for all graphs G. A triple (f,g,h) of positive integers at least 2 is called realizable if there exists a connected graph G with χ(G)=f, Γ(G)=g, and ψ(G)=h. In Chartrand et al. (2010), the list of realizable triples has been found. In this paper we determine the minimum number of vertices in a connected graph with chromatic number f, Grundy number g, and achromatic number h, for all realizable triples (f,g,h) of integers. Furthermore, for f=g=3 we describe the (two) extremal graphs for each h≥6. For h∈{4,5}, there are more extremal graphs, their description is given as well.