Search Results for ""

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

Meißner (1911) showed how to modify the Reuleaux tetrahedron (which is not a solid of constant width) to form a surface of constant width by replacing three of its edge arcs ...

A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...

A pentagonal pyramid is pyramid having a pentagonal base. The edge length e and slant height s of a pentagonal pyramid with regular base of side length a are given by e = ...

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

A polyhedron consisting of a n-gon, a parallel 2n-gon rotated a half-edge turn, and a band of paired triangles separated by pentagons. The only true member giving a ...