On longest cycles in grid graphs

DOI10.1556/SSCMATH.36.2000.1-2.15MaRDI QIDQ2714372zbMATH OpenFDO

Authors B. Menke

Publication date 13 June 2001

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1556/SSCMATH.36.2000.1-2.15

zbMATH Keywords

longest pathspaths and cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Review text

The author studies the question if all longest paths of a connected graph contain a common vertex. First of all he presents a lattice graph with empty intersection of its longest cycles. Then he shows that all grid graphs form a family of graphs that have non-empty intersection of all longest paths (and all are non-Hamiltonian).

Recommendations

• Intersections of longest cycles in grid graphs
• Intersecting longest paths and longest cycles: a survey
• Intersection of longest paths in a graph
• Intersecting longest paths
• All longest cycles in a 2‐connected partial 3‐tree share a common vertex

Cited in

(11)

• On center cycles in grid graphs
• Determinants and Longest Cycles of Graphs
• Planar lattice graphs with Gallai's property
• Highly non-concurrent longest cycles in lattice graphs
• Intersections of longest cycles in grid graphs
• Highly non-concurrent longest paths in lattices
• Lattice graphs with non-concurrent longest cycles
• Intersecting longest paths and longest cycles: a survey
• Longest (s, t)-paths in L-shaped grid graphs
• Highly nonconcurrent longest paths and cycles in lattices
• Intersecting longest cycles in Archimedean tilings

This page was built for publication: On longest cycles in grid graphs

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