Intersecting longest cycles in Archimedean tilings

DOI10.1007/s00453-023-01104-4MaRDI QIDQ6174817

Hamza Iqbal, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem, Muhammad Faisal Nadeem

Publication date: 17 August 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

longest cyclesembedding of graphsGallai's propertyArchimedean tiling graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar lattice graphs with Gallai's property
• Highly non-concurrent longest cycles in lattice graphs
• Intersecting longest paths
• Lattice graphs with non-concurrent longest cycles
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Über längste Wege und Kreise in Graphen
• Ein planarer hypohamiltonscher Graph mit 57 Knoten
• Hard combinatorial problems and minor embeddings on lattice graphs
• Embedding graphs into embedded graphs
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• On longest cycles in grid graphs
• Smallest Sets of Longest Paths with Empty Intersection
• On planar hypohamiltonian graphs
• On longest paths and circuits in graphs.
• Archimedean tiling graphs with Gallai’s property
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

This page was built for publication: Intersecting longest cycles in Archimedean tilings