On longest cycles in grid graphs (Q2714372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On longest cycles in grid graphs |
scientific article; zbMATH DE number 1604275
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On longest cycles in grid graphs |
scientific article; zbMATH DE number 1604275 |
Statements
On longest cycles in grid graphs (English)
0 references
13 June 2001
0 references
paths and cycles
0 references
longest paths
0 references
The author studies the question if all longest paths of a connected graph contain a common vertex. First of all he presents a lattice graph with empty intersection of its longest cycles. Then he shows that all grid graphs form a family of graphs that have non-empty intersection of all longest paths (and all are non-Hamiltonian).
0 references
