Grötzsch graph

English

Etymology

Named after German mathematician Herbert Grötzsch.

Noun

Grötzsch graph (plural Grötzsch graphs)

  1. (graph theory) A triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence.
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.