Cover Image

Boundary rigidity of finite CAT(0) cube complexes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chalopin, Jérémie, Chepoi, Victor
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)

First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)

Non-Clashing Teaching Maps for Balls in Graphs
by: Chalopin, Jérémie, et al.
Published: (2023)

Separation axiom $S_3$ for geodesic convexity in graphs
by: Chepoi, Victor
Published: (2024)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
by: Chalopin, Jérémie, et al.
Published: (2026)

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)

Boundary rigidity of systolic and Helly complexes
by: Blufstein, Martín, et al.
Published: (2025)

Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)

Sample compression schemes for balls in graphs
by: Chalopin, Jérémie, et al.
Published: (2022)

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
by: Liu, Yasong, et al.
Published: (2024)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
by: Bressan, Marco, et al.
Published: (2025)

Geometry of ample/lopsided sets
by: Bandelt, Hans--Jürgen, et al.
Published: (2026)

On embeddings of CAT(0) cube complexes into products of trees
by: Chepoi, Victor, et al.
Published: (2011)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, et al.
Published: (2024)

A note on the distinct distances problem over finite fields
by: Brukhim, Nataly, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination
by: Das, Sandip, et al.
Published: (2026)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

The only Class 0 Flower snark is the smallest
by: Bridi, Guilherme Adamatti, et al.
Published: (2025)

Geometrical Penrose Tilings are characterized by their 1-atlas
by: Fernique, Thomas, et al.
Published: (2022)

Planar Rosa : a family of quasiperiodic substitution discrete plane tilings with $2n$-fold rotational symmetry
by: Kari, Jarkko, et al.
Published: (2022)

Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
by: Kari, Jarkko, et al.
Published: (2020)

A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices
by: Pettie, Seth, et al.
Published: (2024)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
by: Falgas-Ravry, Victor, et al.
Published: (2022)