Name
Abstract | ||
|---|---|---|
In 1966 T. Gallai asked whether connected graphs with empty intersection of their longest paths do or do not exist. After examples of such graphs were found, the question was extended to graphs of higher connectivity, and to cycles instead of paths. Examples being again found, for connectivity up to 3, the question has been asked whether there exist large families of graphs without Gallai's property. The family of grid graphs, a special kind of graphs embedded in the planar square lattice $${\\mathcal {L}}$$ , has been shown by B. Menke to contain no graph enjoying Gallai's property. In this paper we find several examples of graphs embedded in $${\\mathcal {L}}$$ and enjoying that property with respect to both paths and cycles. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00373-012-1177-8 | Graphs and Combinatorics |
Keywords | DocType | Volume |
lattice graphs,longest cycles,longest paths | Journal | 29 |
Issue | ISSN | Citations |
5 | 1435-5914 | 4 |
PageRank | References | Authors |
0.84 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Faisal Nadeem | 1 | 4 | 0.84 |
| Ayesha Shabbir | 2 | 6 | 1.26 |
| Tudor Zamfirescu | 3 | 77 | 16.85 |