Lattice graphs with non-concurrent longest cycles (Q481029)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lattice graphs with non-concurrent longest cycles |
scientific article |
Statements
Lattice graphs with non-concurrent longest cycles (English)
0 references
12 December 2014
0 references
Summary: No hypohamiltonian graphs are embeddable in the planar square lattice. This lattice contains, however, graphs in which every vertex is missed by some longest cycle. In this paper we present graphs with this property, embeddable in various lattices, and of remarkably small order.
0 references
lattice graphs
0 references
longest cycles
0 references
0 references
