HarborthGraph - Maple Help

GraphTheory[SpecialGraphs]

 HarborthGraph
 construct Harborth graph

 Calling Sequence HarborthGraph()

Description

 • The HarborthGraph() command constructs the Harborth graph.
 • The Harborth graph is a 4-regular graph with 52 vertices and 104 edges, named after H. Harborth. It is the smallest known 4-regular matchstick graph.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $H≔\mathrm{HarborthGraph}\left(\right)$
 ${H}{≔}{\mathrm{Graph 1: an undirected graph with 52 vertices and 104 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(H\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{IsRegular}\left(H\right)$
 ${\mathrm{true}}$ (3)
 > $\mathrm{ChromaticNumber}\left(H\right)$
 ${3}$ (4)
 > $\mathrm{DrawPlanar}\left(H\right)$

References

 "Matchstick graph", Wikipedia. http://en.wikipedia.org/wiki/Matchstick_graph

Compatibility

 • The GraphTheory[SpecialGraphs][HarborthGraph] command was introduced in Maple 2020.