AbstractWe elaborate on the convexity properties of (not necessarily finite) weakly median graphs and their prime constituents in order to establish a number of equations in terms of the weakly median operation. Then the weakly median graphs can be identified with the discrete members of an equational class of ternary algebras satisfying five independent axioms on two to four points. This demonstrates that the median algebras featured by Avann and Sholander half a century ago and, more generally, Isbell’s isotropic media can be generalized much further, without losing the close ties with graphs
In the quest to better understand the connection between median graphs, triangle-free graphs and par...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The prop...
AbstractWe bring together algebraic concepts such as equational class and various concepts from grap...
AbstractWe prove that the non-trivial (finite or infinite) weakly median graphs which are undecompos...
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractA median algebra is a ternary algebra which satisfies all the identities true for the median...
This paper establishes a new combinatorial framework for the study of coarse median spaces, bridging...
AbstractWeakly median graphs, being defined by interval conditions and forbidden induced subgraphs, ...
AbstractWe prove that the vertex set of a Kℵ0-free weakly median graph G endowed with the weak topol...
2 A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes,...
Weakly median graphs, being defined by interval conditions and forbidden induced subgraphs, generali...
Abstract. This article investigates structural, geometrical, and topological characterizations and p...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
textabstractA profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of v...
In the quest to better understand the connection between median graphs, triangle-free graphs and par...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The prop...
AbstractWe bring together algebraic concepts such as equational class and various concepts from grap...
AbstractWe prove that the non-trivial (finite or infinite) weakly median graphs which are undecompos...
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractA median algebra is a ternary algebra which satisfies all the identities true for the median...
This paper establishes a new combinatorial framework for the study of coarse median spaces, bridging...
AbstractWeakly median graphs, being defined by interval conditions and forbidden induced subgraphs, ...
AbstractWe prove that the vertex set of a Kℵ0-free weakly median graph G endowed with the weak topol...
2 A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes,...
Weakly median graphs, being defined by interval conditions and forbidden induced subgraphs, generali...
Abstract. This article investigates structural, geometrical, and topological characterizations and p...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
textabstractA profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of v...
In the quest to better understand the connection between median graphs, triangle-free graphs and par...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The prop...