Highly non-concurrent longest paths in lattices
From MaRDI portal
Publication:4633080
DOI10.3906/mat-1502-32zbMath1424.05162OpenAlexW2271517380MaRDI QIDQ4633080
Ayesha Shabbir, Yasir Bashir, Muhammad Faisal Nadeem
Publication date: 2 May 2019
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1502-32
Related Items
Cites Work
- Planar lattice graphs with Gallai's property
- Highly non-concurrent longest cycles in lattice graphs
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- A two-connected planar graph without concurrent longest paths
- Vertices missed by longest paths or circuits
- On planar hypohamiltonian graphs
- A Graph Model for Fault-Tolerant Computing Systems
- On longest paths and circuits in graphs.
- Intersecting longest paths and longest cycles: A survey
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item