Highly non-concurrent longest cycles in lattice graphs

DOI10.1016/J.DISC.2012.03.015MaRDI QIDQ383750zbMATH OpenOpenAlexFDO

Authors Ayesha Shabbir, Tudor 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

lattice graphslongest cycles

Mathematics Subject Classification ID

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

Recommendations

• Highly non-concurrent longest paths in lattices
• Lattice graphs with non-concurrent longest cycles
• Highly nonconcurrent longest paths and cycles in lattices
• On longest cycles in grid graphs
• Intersecting longest paths and longest cycles: a survey

Cites work

• A two-connected planar graph without concurrent longest paths
• Gallai's property for graphs in lattices on the torus and the Möbius strip
• Highly non-concurrent longest paths in lattices
• scientific article; zbMATH DE number 2134119 (Why is no real title available?)
• scientific article; zbMATH DE number 3577225 (Why is no real title available?)
• scientific article; zbMATH DE number 3451870 (Why is no real title available?)
• On longest paths and circuits in graphs.
• Planar lattice graphs with Gallai's property
• Über längste Wege und Kreise in Graphen

Cited in

(6)

• Highly non-concurrent longest paths in lattices
• Lattice graphs with non-concurrent longest cycles
• Fault-tolerant designs in lattice networks on the Klein bottle
• Highly nonconcurrent longest paths and cycles in lattices
• Intersecting longest cycles in Archimedean tilings
• Gallai's property for Archimedean tiling graphs on the torus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383750)