Franklin graph
id:
franklin-graph-166-4429621
title:
Franklin graph
text:
In the mathematical field of graph theory, the Franklin graph is a 3-regular graph with 12 vertices and 18 edges. The Franklin graph is named after Philip Franklin, who disproved the Heawood conjecture on the number of colors needed when a two-dimensional surface is partitioned into cells by a graph embedding. The Heawood conjecture implied that the maximum chromatic number of a map on the Klein bottle should be seven, but Franklin proved that in this case six colors always suffice. The Franklin
brand slug:
wiki
category slug:
encyclopedia
description:
Graph often embedded in the Klein bottle
original url:
https://en.wikipedia.org/wiki/Franklin_graph
date created:
2009-07-23T14:59:26Z
date modified:
2024-08-29T21:14:37Z
main entity:
{"identifier":"Q3115484","url":"https://www.wikidata.org/entity/Q3115484"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/c/ca/Franklin_graph_hamiltonian.svg","width":305,"height":305}
fields total:
13
integrity:
16