Petersen graph

English

Etymology

Named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.

Noun

Petersen graph (plural Petersen graphs)

  1. (graph theory) An undirected graph with 10 vertices and 15 edges, serving as a simple example and counterexample for many problems in graph theory.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.