Archimedean tiling graphs with Gallai’s property

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

[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.Search in Google Scholar

[3] V. S. Gordon, Y. L. Orlovich and F. Werner, Hamiltonian properties of triangular grid graphs, Discrete Math. 308 (2008) 6166-6188.10.1016/j.disc.2007.11.040Search in Google Scholar

[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-9Open DOISearch in Google Scholar

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

[6] A. D. Jumani and T. Zamfirescu, On longest paths in triangular lattice graphs, Util. Math. 89 (2012) 269-273.Search in Google Scholar

[7] S. Klavžar, M. Petkov_sek, Graphs with non empty intersection of longest paths, Ars Combin. 29 (1990) 13-52.Search in Google Scholar

[8] B. Menke, Ch. Zamfirescu and T. Zamfirescu, Intersections of longest cycles in grid graphs, J. Graph Theory 25 (1997) 37-52.10.1002/(SICI)1097-0118(199705)25:1<37::AID-JGT2>3.0.CO;2-JSearch in Google Scholar

[9] F. Nadeem, A. Shabbir, and T. Zamfirescu, Planar lattice graphs with Gallais property, Graphs Combin. 29 (2013) 1523-1529.10.1007/s00373-012-1177-8Open DOISearch in Google Scholar

[10] W. Schmitz, über längste Wege und Kreise in Graphen, Rend. Sem. Mat. Univ. Padova 53 (1975) 97-103.Search in Google Scholar

[11] Z. Skupień, Smallest sets of longest paths with empty intersection, Combin. Probab. Comput. 5 (1996), 429C436.10.1017/S0963548300002170Search in Google Scholar

[12] W. T. Tutte, A theorem on planar graphs, Trans. Amer. Soc. 82 (1956) 99-116.10.1090/S0002-9947-1956-0081471-8Open DOISearch in Google Scholar

[13] H. Walther, über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen, J. Comb. Theory 6 (1969) 1-6.10.1016/S0021-9800(69)80098-0Search in Google Scholar

[14] H. Walther and H.-J. Voss, über Kreise in Graphen, VEB Deutscher Verlag der Wissenschaften, Berlin, 1974.Search in Google Scholar

[15] T. Zamfirescu, A two-connected planar graph without concurrent longest paths, J. Combin. Theory B 13 (1972) 116-121.10.1016/0095-8956(72)90048-2Search in Google Scholar

[16] T. Zamfirescu, On longest paths and circuits in graphs, Math. Scand. 38 (1976) 211-239.10.7146/math.scand.a-11630Open DOISearch in Google Scholar

[17] T. Zamfirescu, Intersecting longest paths or cycles: a short survey, Analele Univ. Craiova, Ser. Mat. Inf. 28 (2001) 1-9.Search in Google Scholar