Sign in
Back
Highly non-concurrent longest cycles in lattice graphs
Journal article   Open access  Peer reviewed

Highly non-concurrent longest cycles in lattice graphs

Ayesha Shabbir and Tudor Zamfirescu
Discrete mathematics, Vol.313(19), pp.1908-1914
06/10/2013
DOI: https://doi.org/10.1016/j.disc.2012.03.015

Abstract

Lattice graphs Longest cycles
There exist planar graphs in which any two vertices are missed by some longest cycle. Although this requirement is very strong, we prove here that such graphs can also be found as subgraphs of the square and hexagonal lattices. Considering (finite) such lattices on the torus and on the Möbius strip enables us to reduce the order of our examples.
url
https://doi.org/10.1016/j.disc.2012.03.015View
Published (Version of record) Open

Metrics

1 Record Views

Details