Yasir Bashir, Tudor Zamfirescu: Lattice graphs with Gallai's property, p.65-71

Abstract:

We investigate graphs with the property that all longest paths or all longest cycles have empty intersection. In this paper, we find such graphs as subgraphs of cubic lattices.

Key Words: Longest paths, longest cycles, Gallai's property, cubic lattices.

2000 Mathematics Subject Classification: Primary: 05C38;
Secondary: 05C62.

Download the paper in pdf format here.