Grötzsch graph
id:
gr-tzsch-graph-288-3944576
title:
Grötzsch graph
text:
In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is named after German mathematician Herbert Grötzsch, who used it as an example in connection with his 1959 theorem that planar triangle-free graphs are 3-colorable. The Grötzsch graph is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence, starting from the one-edge graph;
brand slug:
wiki
category slug:
encyclopedia
description:
Triangle-free graph requiring four colors
original url:
https://en.wikipedia.org/wiki/Gr%C3%B6tzsch_graph
date created:
date modified:
2023-12-06T07:15:55Z
main entity:
{"identifier":"Q3115494","url":"https://www.wikidata.org/entity/Q3115494"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/ba/Groetzsch-graph.svg","width":169,"height":169}
fields total:
13
integrity:
15