Ali Dino Jumani
YOU?
Author Swipe
View article: A Planar Lattice Graph, with Empty Intersection of All Longest Path
A Planar Lattice Graph, with Empty Intersection of All Longest Path Open
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…
View article: A Two-Connected Graph with Gallai’s Property
A Two-Connected Graph with Gallai’s Property Open
The most famous examples of Hypo-Hamiltonian graph is the Petersen graph. Before the discovery of Hypo-traceable graphs, Tibor Gallai, in 1966, raised the question whether the graphs in which each vertex is missed by some longest path. Thi…