Highly non-concurrent longest cycles in lattice graphs

DOI10.1016/j.disc.2012.03.015zbMath1277.05094OpenAlexW2006305199MaRDI QIDQ383750

Ayesha Shabbir, Tudor I. Zamfirescu

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.015

zbMATH Keywords

longest cycleslattice graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Intersecting longest cycles in Archimedean tilings ⋮ Highly non-concurrent longest paths in lattices

Cites Work

• Planar lattice graphs with Gallai's property
• Über längste Wege und Kreise in Graphen
• Gallai's property for graphs in lattices on the torus and the Möbius strip
• A two-connected planar graph without concurrent longest paths
• On longest paths and circuits in graphs.
• Highly non-concurrent longest paths in lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Highly non-concurrent longest cycles in lattice graphs