regular coloring

regular coloring
мат. правильная раскраска

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "regular coloring" в других словарях:

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Fox n-coloring — In the mathematical field of knot theory, Fox n coloring is a method of specifying a representation of a knot group (or a link group) onto the dihedral group of order n where n is an odd integer by coloring arcs in a link diagram (the… …   Wikipedia

  • Caramel coloring — is caramel used as a food coloring; it is made by controlled heating of sugar, generally in the presence of acids or alkalis and possibly other compounds, a process called caramelization. Unlike caramel candy, it tends towards maximum oxidation… …   Wikipedia

  • Dodecahedron — Regular Dodecahedron (Click here for rotating model) Type Platonic solid Elements F = 12, E = 30 V = 20 (χ = 2) Faces by sides 12{5} …   Wikipedia

  • Odd graph — The Petersen graph as an odd graph O3 Vertices Edges …   Wikipedia

  • Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph …   Wikipedia

  • Triangular tiling — Type Regular tiling Vertex configuration 3.3.3.3.3.3 (or 36) Schläfli symbol(s) {3,6} {3[3]} …   Wikipedia

  • Matroid — In combinatorics, a branch of mathematics, a matroid (  /ˈmeɪ …   Wikipedia

  • Tessellation — A tessellation of pavement A honeycomb is an example of a t …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»