Search Results for ""

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 ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...