Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

{{https://www.wm.edu/as/mathematics/faculty-directory/yu_g.php, Gexin Yu}} (William & Mary) Highly connected minors in k-chromatic graphs Abstract: One of the deepest ...