Lattice graphs with non-concurrent longest cycles (Q481029)
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: Lattice graphs with non-concurrent longest cycles |
scientific article; zbMATH DE number 6379717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lattice graphs with non-concurrent longest cycles |
scientific article; zbMATH DE number 6379717 |
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
0.9762608
0 references
0.93459356
0 references
0.9060742
0 references
0.8982778
0 references
0 references
0 references
0 references
0.8849226
0 references
