Archimedean tiling graphs with Gallai’s property-Reference-Cited by-同舟云学术

Archimedean tiling graphs with Gallai’s property

Published:2017-07-26 Issue:2 Volume:25 Page:185-199
ISSN:1844-0835
Container-title:Analele Universitatii "Ovidius" Constanta - Seria Matematica
language:en
Short-container-title:

Author:

Chang Zhikui¹²,Yuan Liping¹²

Affiliation:

1. College of Mathematics and Information Science, Hebei Normal University, 050024 Shijiazhuang , P.R. China

2. Hebei Key Laboratory of Computational Mathematics and Applications, 050024 Shijiazhuang , P.R. China

Abstract

Abstract 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.

Publisher

Walter de Gruyter GmbH

Reference17 articles.

1. [1] Y. Bashir, T. Zamfirescu, Lattice graphs with Gallai's property, Bull. Math. Soc. Sci. Math. Roumanie 56 (2013) 65-71.

2. [2] T. Gallai, Problem 4, in: Theory of Graphs, Proc. Tihany 1966 (ed: P. Erdős and G. Katona), Academic Press, New York, 1968, 362.

3. [3] V. S. Gordon, Y. L. Orlovich and F. Werner, Hamiltonian properties of triangular grid graphs, Discrete Math. 308 (2008) 6166-6188.

4. [4] B. Grünbaum, Vertices missed by longest paths or circuits, J. Comb. Theory A 17 (1974) 31-38.10.1016/0097-3165(74)90025-9

5. [5] Grünbaum, B., Shephard, G. C., Tilings and Patterns. New York: W. H. Freeman and Company, 1987.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations;Complexity;2023-07-03

2. Intersecting Longest Cycles in Archimedean Tilings;Algorithmica;2023-02-10