- n-colorable graph
- мат. раскрашиваемый в n цветов граф, n-раскрашиваемый граф
Большой англо-русский и русско-английский словарь. 2001.
n-colorable graph
Смотреть что такое "n-colorable graph" в других словарях:
Uniquely colorable graph — In graph theory, a uniquely colorable graph is a k chromatic graph that has only one possible (proper) k coloring up to permutation of the colors. Example 1 . A minimal imperfect graph is a graph in which every subgraph is perfect. The deletion… … 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
Colorable — or colourable may refer to: Graph coloring in Mathematics in Law, that a legal burden of proof would be met at trial This disambiguation page lists articles associated with the same title. If an internal l … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Tietze's graph — The Tietze s graph Vertices 12 Edges 18 Diameter … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
