Highly non-concurrent longest cycles in lattice graphs

DOI10.1016/J.DISC.2012.03.015zbMATH Open1277.05094OpenAlexW2006305199MaRDI QIDQ383750FDOQ383750

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

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

zbMATH Keywords

longest cycleslattice graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Fault-tolerant designs in lattice networks on the Klein bottle
• Intersecting longest cycles in Archimedean tilings
• Lattice graphs with non-concurrent longest cycles
• Highly non-concurrent longest paths in lattices
• Highly nonconcurrent longest paths and cycles in lattices

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)