GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/MirzakhaniGraph

GraphTheory[SpecialGraphs]

  

MirzakhaniGraph

  

construct Mirzakhani graph

 

Calling Sequence

Description

Examples

References

Compatibility

Calling Sequence

MirzakhaniGraph()

Description

• 

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.

Examples

withGraphTheory:

withSpecialGraphs:

GMirzakhaniGraph

GGraph 1: an undirected unweighted graph with 63 vertices and 183 edge(s)

(1)

IsPlanarG

true

(2)

ChromaticNumberG

3

(3)

DrawGraphG

References

  

Mirzakhani, Maryam. A small non-4-choosable planar graph. Bull. Inst. Combin. Appl. 17 (1996), 15–18.

Compatibility

• 

The GraphTheory[SpecialGraphs][MirzakhaniGraph] command was introduced in Maple 2018.

• 

For more information on Maple 2018 changes, see Updates in Maple 2018.

See Also

SpecialGraphs