Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

In [1], the following result is proved: Theorem: Let k be a positive integer and let G be a 3-connected infinite planar graph of subexponential growth. Then G contains infinitely many disjoint k-paths ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...