Lattice graphs with non-concurrent longest cycles
From MaRDI portal
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.
Recommendations
- Highly non-concurrent longest cycles in lattice graphs
- Highly nonconcurrent longest paths and cycles in lattices
- Highly non-concurrent longest paths in lattices
- scientific article; zbMATH DE number 4150204
- The lattice of cycles of an undirected graph
- scientific article; zbMATH DE number 3979098
- On longest cycles in grid graphs
- Longest cycles in triangle-free graphs
- Longest cycles in polyhedral graphs
- Longest cycles in certain bipartite graphs
Cites work
- A Graph Model for Fault-Tolerant Computing Systems
- Fault-tolerant design in triangular lattice networks
- Intersecting longest paths and longest cycles: a survey
- Intersections of longest cycles in grid graphs
- Lattice graphs with Gallai's property
- On longest cycles in grid graphs
- On some super fault-tolerant Hamiltonian graphs
- On the construction of combined k-fault-tolerant Hamiltonian graphs
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Planar lattice graphs with Gallai's property
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
Cited in
(4)
This page was built for publication: Lattice graphs with non-concurrent longest cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481029)
