Planar lattice graphs with Gallai's property
From MaRDI portal
Publication:367072
DOI10.1007/s00373-012-1177-8zbMath1272.05095OpenAlexW2052849659MaRDI QIDQ367072
Ayesha Shabbir, Tudor I. Zamfirescu, Muhammad Faisal Nadeem
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1177-8
Related Items (5)
Gallai's property for graphs in lattices on the torus and the Möbius strip ⋮ Highly non-concurrent longest cycles in lattice graphs ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Lattice graphs with non-concurrent longest cycles ⋮ Highly non-concurrent longest paths in lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Über längste Wege und Kreise in Graphen
- A two-connected planar graph without concurrent longest paths
- Vertices missed by longest paths or circuits
- On longest cycles in grid graphs
- A planar hypohamiltonian graph with 48 vertices
- On longest paths and circuits in graphs.
- Intersections of longest cycles in grid graphs
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
This page was built for publication: Planar lattice graphs with Gallai's property