DuererGraph - Maple Help

GraphTheory[SpecialGraphs]

 DuererGraph
 construct Duerer graph

 Calling Sequence DuererGraph()

Description

 • The DuererGraph() command constructs the Dürer graph.
 • The Dürer graph is a nonplanar bipartite graph with 12 vertices and 18 edges. It is named after Albrecht Dürer and is derived from Dürer's solid, a polyhedron first seen in an engraving by Dürer.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{DuererGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 12 vertices and 18 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(G\right)$
 ${\mathrm{false}}$ (2)
 > $\mathrm{ChromaticNumber}\left(G\right)$
 ${3}$ (3)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Dürer graph", Wikipedia. http://en.wikipedia.org/wiki/Duerer_graph

Compatibility

 • The GraphTheory[SpecialGraphs][DuererGraph] command was introduced in Maple 2019.
 • For more information on Maple 2019 changes, see Updates in Maple 2019.