construct Mirzakhani graph
The MirzakhaniGraph() command returns the Mirzakhani graph, a 3-colorable planar graph with 63 vertices which is not 4-choosable.
The Mirzakhani graph is the smallest known graph satisfying these properties and was discovered by Maryam Mirzakhani in 1996.
G ≔ MirzakhaniGraph⁡
G≔Graph 1: an undirected graph with 63 vertices and 183 edge(s)
Mirzakhani, Maryam. A small non-4-choosable planar graph. Bull. Inst. Combin. Appl. 17 (1996), 15–18.
The GraphTheory[SpecialGraphs][MirzakhaniGraph] command was introduced in Maple 2018.
For more information on Maple 2018 changes, see Updates in Maple 2018.
Download Help Document
What kind of issue would you like to report? (Optional)