Search Results for ""

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

The term in rigidity theory for the edges of a graph.

The number of nodes in a graph is called its order.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...