• Thumbnail for Klein graphs
    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...
    6 KB (568 words) - 23:24, 24 April 2024
  • Klein geometry Klein configuration, in geometry Klein cubic (disambiguation) Klein graphs, in graph theory Klein model, or Beltrami–Klein model, a model...
    1 KB (212 words) - 08:30, 6 June 2023
  • of graphs contains definitions of graphs and graph families. For collected definitions of graph theory terms that do not refer to individual graph types...
    14 KB (1,251 words) - 14:50, 13 March 2024
  • Thumbnail for Klein four-group
    In mathematics, the Klein four-group is an abelian group with four elements, in which each element is self-inverse (composing it with itself produces...
    10 KB (1,357 words) - 07:18, 20 August 2024
  • Thumbnail for Klein quartic
    In hyperbolic geometry, the Klein quartic, named after Felix Klein, is a compact Riemann surface of genus 3 with the highest possible order automorphism...
    27 KB (3,263 words) - 07:08, 26 August 2024
  • Klein four-group Klein geometry Klein graphs Klein's inequality Klein model Klein polyhedron Klein surface Klein quadric Klein quartic Kleinian group Kleinian...
    2 KB (139 words) - 21:51, 19 January 2024
  • Thumbnail for Loop (graph theory)
    Where graphs are defined so as to allow loops and multiple edges, a graph without loops or multiple edges is often distinguished from other graphs by calling...
    3 KB (390 words) - 06:31, 26 March 2024
  • Thumbnail for Heawood graph
    Trivalent Symmetric Graphs of Small Order" (PDF). Australasian Journal of Combinatorics. 11: 146. Royle, G. "Cubic Symmetric Graphs (The Foster Census)...
    10 KB (1,001 words) - 13:25, 14 August 2024
  • Thumbnail for Graph embedding
    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...
    13 KB (1,744 words) - 07:48, 18 July 2024
  • Thumbnail for Diamond graph
    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...
    3 KB (352 words) - 07:00, 26 June 2022