Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bok, Jan
Fiala, Jiří
Jedličková, Nikola
Kratochvíl, Jan
and
Rzążewski, Paweł
2022.
Combinatorial Algorithms.
Vol. 13270,
Issue. ,
p.
228.
Bridson, Martin R
and
Shepherd, Sam
2022.
Leighton’s theorem : Extensions, limitations and quasitrees.
Algebraic & Geometric Topology,
Vol. 22,
Issue. 2,
p.
881.
Shepherd, Sam
and
Woodhouse, Daniel J.
2022.
Quasi-isometric rigidity for graphs of virtually free groups with two-ended edge groups.
Journal für die reine und angewandte Mathematik (Crelles Journal),
Vol. 2022,
Issue. 782,
p.
121.
Woodhouse, Daniel J
2023.
Leighton’s theorem and regular cube
complexes.
Algebraic & Geometric Topology,
Vol. 23,
Issue. 7,
p.
3395.
DERGACHEVA, NATALIA S.
and
KLYACHKO, ANTON A.
2023.
Small non-Leighton two-complexes.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 174,
Issue. 2,
p.
385.
Stark, Emily R.
and
Woodhouse, Daniel J.
2024.
Action rigidity for free products of hyperbolic manifold groups.
Annales de l'Institut Fourier,
Vol. 74,
Issue. 2,
p.
503.
Bok, Jan
Fiala, Jiří
Jedličková, Nikola
Kratochvíl, Jan
and
Rzążewski, Paweł
2024.
List Covering of Regular Multigraphs with Semi-edges.
Algorithmica,
Vol. 86,
Issue. 3,
p.
782.
Shepherd, Sam
2024.
Commensurability of lattices in right-angled buildings.
Advances in Mathematics,
Vol. 441,
Issue. ,
p.
109522.
Dergacheva, Natalia S.
and
Klyachko, Anton A.
2025.
Tiny non-Leighton complexes.
Geometriae Dedicata,
Vol. 219,
Issue. 3,
Bok, Jan
Fiala, Jiří
Hliněný, Petr
Jedličková, Nikola
and
Kratochvíl, Jan
2026.
Computational complexity of covering multigraphs with semi-edges: Small cases.
Journal of Computer and System Sciences,
Vol. 156,
Issue. ,
p.
103714.