Search results for: ACHROMATIC NUMBER

• 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

• Topic 1: Transformations / Spatial form design, scale 1:1

  e-Learning Courses

  • E. Urwanowicz
  • K. Wróblewski
  • P. Różycki

  Brief description: The subject matter of the spatial form design classes is transformation. First, a black square becomes a flat graphic composition, which is then converted to color. The final stage of the transformation process is a spatial object, which is by assumption devoid of any utilitarian functions. Course content / classes schedule:   1. Graphic. The task is to create an achromatic flat composition in the contrast...

• SPACIAL FORM DESIGN scale 1:1

  e-Learning Courses

  • Ł. Ławrynowicz
  • K. Wróblewski

  Brief description: The subject matter of the spatial form design classes is transformation. First, a black square becomes a flat graphic composition, which is then converted to color. The final stage of the transformation process is a spatial object, which is by assumption devoid of any utilitarian functions. Course content / classes schedule:   1. Graphic. The task is to create an achromatic flat composition in the contrast...