Gallai in 1966 raised the question 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. In this paper we present some graphs embeddable into Archimedean tiling graphs, with both connectivity 1 and 2, satisfying Gallai’s property.
© 2017 Zhikui Chang, Liping Yuan, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.