red-blue graph
Смотреть что такое "red-blue graph" в других словарях:
Blue Earth County, Minnesota — Location in the state of Minnesota … 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
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Dual graph — G′ is the dual graph of G In mathematics, the dual graph of a given planar graph G is a graph which has a vertex for each plane region of G, and an edge for each edge in G joining two neighboring regions, for a certain embedding of G. The term… … Wikipedia
Cayley graph — In mathematics, the Cayley graph, also known as the Cayley colour graph, is the graph that encodes the structure of a discrete group. Its definition is suggested by Cayley s theorem (named after Arthur Cayley) and uses a particular, usually… … Wikipedia
König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Road coloring problem — In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from… … Wikipedia
Theorem on friends and strangers — All the 78 possible friends strangers graphs with 6 nodes. For each graph the red/blue nodesshows a sample triplet of mutual friends/strangers.The friendship theorem is a mathematical theorem in an area of mathematics called Ramsey… … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
Hackenbush — is a two player mathematical game which may be played on any configuration of colored line segments connected to one another by their endpoints and to the ground. More precisely, there is a ground (conventionally, but not necessarily, a… … Wikipedia
