Search results for: ACHROMATIC NUMBER - Bridge of Knowledge

Search results for: ACHROMATIC NUMBER

results on page:
embed this view on your website

Found little results, maybe try searching with alternative method.

Filters

total: 3
filtered: 1

clear all filters

Chosen catalog filters

Minimum order of graphs with given coloring parameters
Publication
- G. Bacsó
- P. Borowiecki
- M. Hujter
- Z. Tuza
- DISCRETE MATHEMATICS - Year 2015
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),...

Full text available to download