A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Planar Lattice Graph, with Empty Intersection of All Longest Path

2019
*
Engineering Mathematics
*

Tibor Gallai in 1966 elevated the declaration about the existence of graphs with the property that every vertex is missed by some longest path. This property will be called Gallai's property. First answer back by H. Walther, who introduced a planar graph on 25 vertices satisfying Gallai's property, and various authors worked on that property, after examples of such graphs were found while examining such n-dimensional L n graphs with the property that every longest Paths have empty intersection,

doi:10.11648/j.engmath.20190301.12
fatcat:nqb3sqzicvazbh4di42wu6sgtq