Highly non-concurrent longest paths in lattices

Yasir BASHIR, Faisal NADEEM, Ayesha SHABBIR
2016 Turkish Journal of Mathematics  
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öbius strip and the Klein bottle.
doi:10.3906/mat-1502-32 fatcat:inamchvdejgnhmse5qjnw2xrvq