Recommendations
Cites work
- A planar hypohamiltonian graph with 48 vertices
- A two-connected planar graph without concurrent longest paths
- scientific article; zbMATH DE number 2134119 (Why is no real title available?)
- scientific article; zbMATH DE number 3451870 (Why is no real title available?)
- Intersections of longest cycles in grid graphs
- On longest cycles in grid graphs
- On longest paths and circuits in graphs.
- Vertices missed by longest paths or circuits
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Über längste Wege und Kreise in Graphen
Cited in
(11)- Gallai's property for graphs in lattices on the torus and the Möbius strip
- scientific article; zbMATH DE number 4021205 (Why is no real title available?)
- Highly non-concurrent longest cycles in lattice graphs
- The Liouville and the intersection properties are equivalent for planar graphs
- Highly non-concurrent longest paths in lattices
- Archimedean tiling graphs with Gallai's property
- Lattice graphs with non-concurrent longest cycles
- Archimedean tiling graphs with Gallai's property.
- Every planar graph with the Liouville property is amenable
- Intersecting longest cycles in Archimedean tilings
- Gallai's property for Archimedean tiling graphs on the torus
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)