First-order logic axiomatization of metric graph theory
From MaRDI portal
Publication:6196830
DOI10.1016/j.tcs.2024.114460arXiv2203.01070OpenAlexW4392005262MaRDI QIDQ6196830
Manoj Changat, Jeny Jacob, Jérémie Chalopin, Victor Chepoi
Publication date: 15 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.01070
Cites Work
- Uniform hyperbolicity of the graphs of curves
- Bucolic complexes
- Characterizing almost-median graphs. II.
- Pseudo-median graphs are join spaces
- Median graphs, parallelism and posets
- Points and lines. Characterizing the classical geometries
- Isometric embedding in products of complete graphs
- On the definability of properties of finite graphs
- Clique graphs and Helly graphs
- Simplicial nonpositive curvature
- Basis graphs of even delta-matroids
- Characterizing almost-median graphs
- Convexity in partial cubes: the hull number
- Hyperplane arrangements with a lattice of regions
- Axiomatic characterization of the interval function of a graph
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Netlike partial cubes II. Retracts and netlike subgraphs
- Netlike partial cubes III. The median cycle property
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- On the Helly property working as a compactness criterion on graphs
- The theory of convex geometries
- Local recognition of Tits geometries of classical type
- Distance-hereditary graphs
- Pseudo-modular graphs
- Some combinatorial properties of discriminants in metric vector spaces
- On local convexity in graphs
- On bridged graphs and cop-win graphs
- Pseudomatroids
- Isometric embeddings in Hamming graphs
- Dismantling absolute retracts of reflexive graphs
- A Helly theorem in weakly modular space
- Petri nets, event structures and domains. I
- Lopsided sets and orthant-intersection by convex sets
- Dual polar spaces
- A canonical decomposition theory for metrics on a finite set
- On scale embeddings of graphs into hypercubes
- Buildings of spherical type and finite BN-pairs
- Oriented matroids
- Orientability of matroids
- Median graphs and Helly hypergraphs
- A convexity lemma and expansion procedures for bipartite graphs
- Separation of two convex sets in convexity structures
- A set of postulates for plane geometry, based on scale and protractor
- Bridged graphs are cop-win graphs: An algorithmic proof
- Coxeter matroids. With illustrations by Anna Borovik
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Obstructions to a small hyperbolicity in Helly graphs
- A note on the interval function of a disconnected graph
- COMs: complexes of oriented matroids
- Distance-preserving subgraphs of Johnson graphs
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- Geometry of the complex of curves. I: Hyperbolicity
- Vertex-to-vertex pursuit in a graph
- Algorithmic graph theory and perfect graphs
- Axioms for maximal vectors of an oriented matroid: A combinatorial characterization of the regions determined by an arrangement of pseudohyperplanes
- Defect Sauer results
- Cellular bipartite graphs
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- Graphs of some CAT(0) complexes
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- A counterexample to Thiagarajan's conjecture on regular event structures
- Axiomatic characterization of the interval function of a bipartite graph
- On weak \(\epsilon\)-nets and the Radon number
- On tope graphs of complexes of oriented matroids
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- 1-slim triangles and uniform hyperbolicity for arc graphs and curve graphs
- On two conjectures of maurer concerning basis graphs of matroids
- Axiomatic characterization of the interval function of a block graph
- Netlike partial cubes. I. General properties
- Combinatorics of lopsided sets
- Six theorems about injective metric spaces
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- Les immeubles des groupes de tresses généralises
- Matroid basis graphs. I
- Distance-preserving subgraphs of hypercubes
- A general set-separation theorem
- Graphs with Connected Medians
- Weak hyperbolicity of cube complexes and quasi-arboreal groups
- Infinite median graphs, (0, 2)-graphs, and hypercubes
- Nice Labeling Problem for Event Structures: A Counterexample
- An application of games to the completeness problem for formalized theories
- Metric Ternary Distributive Semi-Lattices
- Ternary spaces, media, and Chebyshev sets
- Retracts of hypercubes
- Weakly Modular Graphs and Nonpositive Curvature
- Intersection numbers and the hyperbolicity of the curve complex
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Conditions for invariance of set diameters under d-convexification in a graph
- Greedy algorithm and symmetric matroids
- Minimal extensions of graphs to absolute retracts
- Graphs with intrinsic s3 convexities
- A characterization of ptolemaic graphs
- Median Algebra
- Invariant Arcs, Whitney Levels, and Kelley Continua
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- On Distance-Preserving and Domination Elimination Orderings
- Tarski's System of Geometry
- Modular Interval Spaces
- A characterization of the interval function of a connected graph
- Quasi‐median graphs and algebras
- 1-Hyperbolic Graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- The geometry of the disk complex
- 1-Safe Petri Nets and Special Cube Complexes
- The complexity of satisfiability problems
- Dismantlability of weakly systolic complexes and applications
- A Characterization of Certain Ptolemaic Graphs
- Characterizations of derived graphs
- Some Elementary Properties of Interval Convexities
- On the Addressing Problem for Loop Switching
- A ternary operation in distributive lattices
- Trees, Lattices, Order, and Betweenness
- Medians and Betweenness
- Medians, Lattices, and Trees
- Transitivities of Betweenness
- Geometry of cuts and metrics
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Graphs with convex balls
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
