Wyniki wyszukiwania dla: ACHROMATIC NUMBER
Znaleźliśmy mało wyników, wypróbuj alternatywnej metody wyszukiwania.
Filtry
wszystkich: 3
wybranych: 1
Filtry wybranego katalogu
Wyniki wyszukiwania dla: ACHROMATIC NUMBER
-
Minimum order of graphs with given coloring parameters
PublikacjaA 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),...