Archdeacon et al. (2004) describe partitions of the edges of a crown graph into equal-length cycles.

The 2n-vertex crown graph may be embedded into four-dimensional Euclidean space in such a way that all of its edges have unit length.

In etiquette, a traditional rule for arranging guests at a dinner table is that men and women should alternate positions, and that no married couple should sit next to each other.

[4] The arrangements satisfying this rule, for a party consisting of n married couples, can be described as the Hamiltonian cycles of a crown graph.

[6] Fürer (1995) uses crown graphs as part of a construction showing hardness of approximation of coloring problems.