Planar lattice graphs with Gallai's property
From MaRDI portal
Publication:367072
DOI10.1007/S00373-012-1177-8zbMATH Open1272.05095OpenAlexW2052849659MaRDI QIDQ367072FDOQ367072
Authors: Ayesha Shabbir, M. F. Nadeem, Tudor Zamfirescu 
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
Recommendations
Cites Work
- Über längste Wege und Kreise in Graphen
- Title not available (Why is that?)
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- On longest paths and circuits in graphs.
- Intersections of longest cycles in grid graphs
- 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
- Title not available (Why is that?)
Cited In (10)
- Gallai's property for graphs in lattices on the torus and the Möbius strip
- The Liouville and the intersection properties are equivalent for planar graphs
- Archimedean tiling graphs with Gallai's property.
- Intersecting longest cycles in Archimedean tilings
- Every planar graph with the Liouville property is amenable
- Title not available (Why is that?)
- Lattice graphs with non-concurrent longest cycles
- Highly non-concurrent longest paths in lattices
- Highly non-concurrent longest cycles in lattice graphs
- Archimedean tiling graphs with Gallai's property
This page was built for publication: Planar lattice graphs with Gallai's property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367072)
