Lattice graphs with non-concurrent longest cycles

DOI10.4171/RSMUP/132-6zbMath1306.05114OpenAlexW2026430023MaRDI QIDQ481029

Carol T. Zamfirescu, Ali Dino Jumani, Tudor I. Zamfirescu

Publication date: 12 December 2014

Published in: Rendiconti del Seminario Matematico della Università di Padova (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/rsmup/132-6

zbMATH Keywords

longest cycleslattice graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Intersecting longest cycles in Archimedean tilings

Cites Work

• Unnamed Item
• Planar lattice graphs with Gallai's property
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• On some super fault-tolerant Hamiltonian graphs
• On longest cycles in grid graphs
• On the construction of combinedk-fault-tolerant Hamiltonian graphs
• A Graph Model for Fault-Tolerant Computing Systems
• Intersections of longest cycles in grid graphs
• Intersecting longest paths and longest cycles: A survey
• Fault-tolerant designs in triangular lattice networks
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

This page was built for publication: Lattice graphs with non-concurrent longest cycles