Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...
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