ðə kˈɑːksɛɾɚ ɡɹˈæf mˈeɪ ˈɔːlsoʊ biː kənstɹˈʌktᵻd fɹʌmðə smˈɔːlɚ dˈɪstənsɹˈɛɡjʊlɚ hˈiːwʊd ɡɹˈæf baɪ kənstɹˈʌktɪŋ ɐ vˈɜːtɛks fɔːɹ ˈiːtʃ sˈɪkssˈaɪkəl ɪnðə hˈiːwʊd ɡɹˈæf ænd ɐn ˈɛdʒ fɔːɹ ˈiːtʃ dɪsdʒˈɔɪnt pˈɛɹ ʌv sˈɪkssˈaɪkəlz.
The Coxeter graph may also be constructed from the smaller distance-regular Heawood graph by constructing a vertex for each 6-cycle in the Heawood graph and an edge for each disjoint pair of 6-cycles.