Petersen graph
id:
petersen-graph-164-7910293
title:
Petersen graph
text:
In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by A. B. Kempe (
brand slug:
wiki
category slug:
encyclopedia
description:
Cubic graph with 10 vertices and 15 edges
original url:
https://en.wikipedia.org/wiki/Petersen_graph
date created:
2003-03-11T20:39:47Z
date modified:
2024-08-29T00:46:34Z
main entity:
{"identifier":"Q835614","url":"https://www.wikidata.org/entity/Q835614"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/91/Petersen1_tiny.svg","width":220,"height":220}
fields total:
13
integrity:
16