<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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. </p></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.

Archimedean tiling graphs with Gallai’s property

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"Archimedean tiling graphs with Gallai\u2019s property"}

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

Archimedean tiling graphs with Gallai’s property

Publicado en línea: 21 sept 2017

Páginas: 185 - 199

Recibido: 01 abr 2016

Aceptado: 01 abr 2016

DOI: https://doi.org/10.1515/auom-2017-0029

Palabras clave
Gallai’s property, Archimedean tiling graphs, the longest path

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Archimedean tiling graphs with Gallai’s property

Publicado en línea: 21 sept 2017

Páginas: 185 - 199

Recibido: 01 abr 2016

Aceptado: 01 abr 2016

DOI: https://doi.org/10.1515/auom-2017-0029

Palabras claveGallai’s property, Archimedean tiling graphs, the longest path

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Palabras clave
Gallai’s property, Archimedean tiling graphs, the longest path