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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback