Klein graphs information

In the mathematical field of graph theory, the Klein graphs are two different but related regular graphs, each with 84 edges. Each can be embedded in...

Klein geometry Klein configuration, in geometry Klein cubic (disambiguation) Klein graphs, in graph theory Klein model, or Beltrami–Klein model, a model...

of graphs contains definitions of graphs and graph families. For collected definitions of graph theory terms that do not refer to individual graph types...

In hyperbolic geometry, the Klein quartic, named after Felix Klein, is a compact Riemann surface of genus 3 with the highest possible order automorphism...

and only if it does not have one of the seven graphs of the Petersen family as a minor. The Petersen graph and associated map embedded in the projective...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

Hamiltonian graph. A graph is diamond-free if it has no diamond as an induced subgraph. The triangle-free graphs are diamond-free graphs, since every...

Klein four-group Klein geometry Klein graphs Klein's inequality Klein model Klein polyhedron Klein surface Klein quadric Klein quartic Kleinian group Kleinian...

distance-transitive graphs into C-UH graphs that yielded the above-mentioned paper and also allowed to confront, as digraphs, the Pappus graph to the Desargues graph. These...

Trivalent Symmetric Graphs of Small Order" (PDF). Australasian Journal of Combinatorics. 11: 146. Royle, G. "Cubic Symmetric Graphs (The Foster Census)...

graph, chordal bipartite graph, or chain graph. It can be solved in polynomial time for split graphs, threshold graphs, and graphs in which every five vertices...

graph K2, the Petersen graph, the Coxeter graph and two graphs derived from the Petersen and Coxeter graphs by replacing each vertex with a triangle....

problem can be defined for graphs whether undirected, directed, or mixed. Here it is defined for undirected graphs; for directed graphs the definition of path...

efficient algorithms exist for special kinds of bipartite graphs: For sparse bipartite graphs, the maximum matching problem can be solved in O ~ ( E 10...

icosahedron. Every Platonic graph, including the icosahedral graph, is a polyhedral graph. This means that they are planar graphs, graphs that can be drawn in...

The graphs below show examples of hypothetical survival functions. The x-axis is time. The y-axis is the proportion of subjects surviving. The graphs show...

suffice. (The Klein bottle is the only surface for which the Heawood conjecture fails.) The Franklin graph can be embedded in the Klein bottle so that...

colors, rather than 7 as predicted by the formula. The Franklin graph can be drawn on the Klein bottle in a way that forms six mutually-adjacent regions, showing...

well-studied collaboration graphs include: Collaboration graph of mathematicians also known as the Erdős collaboration graph, where two mathematicians...

of small integers – 1 through 6, depending on the graph. The ordinary ADE graphs are the only graphs that admit a positive labeling with the following...

which gives a linear run-time for dense graphs. There are other algorithms that work in linear time on dense graphs. If the edge weights are integers represented...

color theorem for triangulated graphs to prove it for all planar graphs, and without loss of generality we assume the graph is triangulated. Suppose v, e...