scholarly journals Archimedean tiling graphs with Gallai’s property

2017 ◽  
Vol 25 (2) ◽  
pp. 185-199
Author(s):  
Zhikui Chang ◽  
Liping Yuan

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

2012 ◽  
Vol 160 (3) ◽  
pp. 210-217 ◽  
Author(s):  
Fatemeh Keshavarz-Kohjerdi ◽  
Alireza Bagheri ◽  
Asghar Asgharian-Sardroud

Soft Matter ◽  
2017 ◽  
Vol 13 (47) ◽  
pp. 8894-8902 ◽  
Author(s):  
Zdeněk Preisler ◽  
Barbara Saccà ◽  
Stephen Whitelam

DNA nanoparticles with three-fold coordination have been observed to self-assemble in experiment into a network equivalent to the hexagonal (6.6.6) tiling, and a network equivalent to the 4.8.8 Archimedean tiling.


2017 ◽  
Vol 689 ◽  
pp. 67-95 ◽  
Author(s):  
Archontia C. Giannopoulou ◽  
George B. Mertzios ◽  
Rolf Niedermeier

Author(s):  
David Karger ◽  
Rajeev Motwani ◽  
G. D. S. Ramkumar
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document