A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Two-Connected Graph with Gallai's Property
2019
Advances in Wireless Communications and Networks
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. This property will be called Gallai's property, various authors worked on that property. In 1969, Gallai's question was first replied through H. Walther[2], who introduced a planar graph on 25 vertices satisfying Gallai's criterion. Furthermore, H. Walther and H.
doi:10.11648/j.awcn.20190501.14
fatcat:cems36b3e5d3jjlugdxp4htjqi