The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
From MaRDI portal
Publication:6615767
DOI10.1016/j.jctb.2024.08.002zbMATH Open1548.05158MaRDI QIDQ6615767
Clément Legrand-Duchesne, Louis Esperet, Unnamed Author
Publication date: 8 October 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On vertex transitive graphs of infinite degree
- Groups, the theory of ends, and context-free languages
- Graphs and groups with tree-like properties
- The accessibility of finitely presented groups
- Surfaces and planar discontinuous groups. Revised and expanded transl. from the German by J. Stillwell
- Graph minors. X: Obstructions to tree-decomposition
- The Hadwiger number of infinite vertex-transitive graphs
- Connectivity and planarity of Cayley graphs
- Excluding a countable clique
- Vertex-transitive graphs and accessibility
- Graph minors. XVI: Excluding a non-planar graph
- The domino problem on groups of polynomial growth
- Accessibility in transitive graphs
- Planar transitive graphs
- Profiles of separations: in graphs, matroids, and beyond
- Automorphisms and endomorphisms of infinite locally finite graphs
- Über eine Eigenschaft der ebenen Komplexe
- Über die Enden diskreter Räume und Gruppen
- Enden offener Räume und unendliche diskontinuierliche Gruppen
- Canonical trees of tree-decompositions
- A Stallings type theorem for quasi-transitive graphs
- Tangles and Connectivity in Graphs
- Graph Theory
- On Cayley graphs of virtually free groups
- On the lattice of subgroups of the lamplighter group
- Finite and infinite cyclic extensions of free groups
- Some applications of graph contractions
- Quasi-4-Connected Components
- About the Domino Problem for Subshifts on Groups
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- Infinite-ended groups with planar Cayley graphs
- The undecidability of the domino problem
- Proceedings of the 64th annual IEEE symposium on foundations of computer science, FOCS 2023, Santa Cruz, CA, USA, November 6--9, 2023
This page was built for publication: The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
