Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface. - James Davies 001; Carsten Thomassen (Electron. J. Comb., 2020)

Colouring Polygon Visibility Graphs and Their Generalizations. - James Davies 001; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (SoCG, 2021)

Edge-maximal graphs on orientable and some nonorientable surfaces. - James Davies 001; Florian Pfender (J. Graph Theory, 2021)

A Solution to Ringel's Circle Problem. - James Davies 001; Chaya Keller; Linda Kleist; Shakhar Smorodinsky; Bartosz Walczak (SoCG, 2022)

Vertex-Minor-Closed Classes are χ-Bounded. - James Davies 001 (Comb., 2022)

Triangle-free graphs with large chromatic number and no induced wheel. - James Davies 001 (J. Graph Theory, 2023)

Coloring polygon visibility graphs and their generalizations. - James Davies 001; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (J. Comb. Theory B, 2023)

Grounded L-Graphs Are Polynomially χ-Bounded. - James Davies 001; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (Discret. Comput. Geom., 2023)

Separating Polynomial χ-Boundedness from χ-Boundedness. - Marcin Brianski; James Davies 001; Bartosz Walczak (Comb., 2024)

Counterexample to Babai's lonely colour conjecture. - James Davies 001; Meike Hatzel; Liana Yepremyan (CoRR, 2024)

Colouring t-perfect graphs. - Maria Chudnovsky; Linda Cook; James Davies 001; Sang-il Oum; Jane Tan (CoRR, 2024)

Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs. - James Davies 001; Agelos Georgakopoulos; Meike Hatzel; Rose McCarty (SoCG, 2025)

Pivot-minors and the Erdős-Hajnal conjecture. - James Davies 001 (J. Comb. Theory B, 2025)

Preparing graph states forbidding a vertex-minor. - James Davies 001; Andrew Jena (CoRR, 2025)

Odd coloring graphs with linear neighborhood complexity. - James Davies 001; Meike Hatzel; Kolja Knauer; Rose McCarty; Torsten Ueckerdt (CoRR, 2025)

String graphs are quasi-isometric to planar graphs. - James Davies 001 (CoRR, 2025)

Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth. - Matija Bucic; James Davies 001 (Am. Math. Mon., 2025)

Burling Graphs in Graphs with Large Chromatic Number. - Tara Abrishami; Marcin Brianski; James Davies 001; Xiying Du; Jana Masaríková; Pawel Rzazewski; Bartosz Walczak (SODA, 2026)

Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity. - James Davies 001; Yelena Yuditsky (Innov. Graph Theory, 2026)

Reuniting χ-boundedness with polynomial χ-boundedness. - Maria Chudnovsky; Linda Cook; James Davies 001; Sang-il Oum (J. Comb. Theory B, 2026)