**Three-dimensional graph products with unbounded stack-number**.

D. Eppstein, R. Robert Hickingbotham, L. Merker, S. Norin, M. T. Seweryn, and D. R. Wood.

arXiv:2202.05327.

*Discrete Comput. Geom.*71: 1210–1237, 2024.

The strong product of any three graphs of non-constant size has unbounded book thickness. In the case of strong products of three paths, and more generally of triangulations of \(n\times n\times n\) grid graphs obtained by adding a diagonal to each square of the grid, the book thickness is \(\Theta(n^{1/3})\). This is the first explicit example of a graph family with bounded maximum degree and unbounded book thickness.

**Games on game graphs**.

D. Eppstein. AMS Special Session on Serious Recreational Mathematics, Joint Mathematics Meetings, San Francisco, 2024.

This talk surveys graph parameters defined from pursuit-evasion games on graphs, including cop-number, treewidth, and flip-width, and the values of these parameters on graphs derived from games and puzzles.

**Non-Euclidean Erdős–Anning theorems**.

D. Eppstein.

arXiv:2401.06328.

**Maintaining light spanners via minimal updates**.

D. Eppstein and H. Khodabandeh.

arXiv:2403.03290.

Years – Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.