Highly non-concurrent longest paths in lattices
Yasir Bashir, Muhammad Faisal Nadeem, Ayesha Shabbir · TURKISH JOURNAL OF MATHEMATICS · 2015
In this paper we consider graphs in which any pair of vertices is missed by some longest path. We are proving the existence of such graphs in the infinite triangular, square and hexagonal lattices in the plane. Moreover, we extend our investigation to lattices on several surfaces such as the torus, the M\"obius strip and the Klein bottle.