Search
Abstract
A complete k-coloring of a graph G=(V,E) is an assignment F: 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 &varphi with exactly k colors such that every vertex v∈V of color F(v) has a neighbor of color i for all 1 <= i < F(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. Chartrand et al. (A note on graphs with prescribed complete coloring numbers, J. Combin. Math. Combin. Comput. LXXIII (2010) 77-84) found the list of realizable triples. 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 and h = 5, there are more extremal graphs, their description is contained as well.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (4)
-
Gábor Bacsó
- Hungarian Academy of Sciences .
-
Mihály Hujter
- Budapest University of Technology and Economics .
-
Zsolt Tuza
- Hungarian Academy of Sciences .
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.disc.2014.12.002
- License
- Copyright (2014 Elsevier B.V)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
DISCRETE MATHEMATICS
no. 338,
edition 4,
pages 621 - 632,
ISSN: 0012-365X - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Bacsó G., Borowiecki P., Hujter M., Tuza Z.: Minimum order of graphs with given coloring parameters// DISCRETE MATHEMATICS. -Vol. 338, iss. 4 (2015), s.621-632
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.disc.2014.12.002
- Verified by:
- Gdańsk University of Technology
seen 156 times