The following pages link to (Q3890733):
Displaying 50 items.
- Triangle path transit functions, betweenness and pseudo-modular graphs (Q1024473) (← links)
- Netlike partial cubes III. The median cycle property (Q1025465) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- Netlike partial cubes, V: completion and netlike classes (Q1043960) (← links)
- Distance monotonicity and a new characterization of Hamming graphs (Q1044739) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- Induced cycles in crossing graphs of median graphs (Q1045199) (← links)
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces (Q1056760) (← links)
- Networks with Condorcet solutions (Q1058436) (← links)
- Distance-hereditary graphs (Q1084114) (← links)
- Pseudo-modular graphs (Q1084416) (← links)
- On local convexity in graphs (Q1089354) (← links)
- A fixed cube theorem for median graphs (Q1092929) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- Isometric embeddings in Hamming graphs (Q1110526) (← links)
- Constructions of ranked posets (Q1110546) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- Convex sets in graphs. II: Minimal path convexity (Q1120125) (← links)
- Dismantling absolute retracts of reflexive graphs (Q1121291) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- Invariant Hamming graphs in infinite quasi-median graphs (Q1126287) (← links)
- Another characterization of hypercubes (Q1162520) (← links)
- Superextensions and the depth of median graphs (Q1175949) (← links)
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication (Q1182965) (← links)
- The retracts of Hamming graphs (Q1193717) (← links)
- Distance monotone graphs and a new characterization of hypercubes (Q1208343) (← links)
- A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1 (Q1210576) (← links)
- Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis (Q1263914) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Metric coset schemes revisited (Q1296146) (← links)
- Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
- A new characterization of median graphs (Q1322201) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Clique-gated graphs (Q1356418) (← links)
- Characterization of products of trees and grids (Q1356541) (← links)
- Generalized hypercubes and (0, 2)-graphs (Q1356767) (← links)
- The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree (Q1357731) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- The majority strategy on graphs (Q1377621) (← links)
- Steiner intervals in graphs (Q1382264) (← links)
- Retracts of infinite Hamming graphs (Q1386474) (← links)
- The median procedure on median graphs (Q1392574) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Decomposition and \(l_1\)-embedding of weakly median graphs (Q1582477) (← links)
- An Euler-type formula for median graphs (Q1584314) (← links)
- g-convex weight sequences (Q1649131) (← links)
- Generalized Hamming graphs: some new results (Q1649899) (← links)
- Trees with unique least central subtrees (Q1649916) (← links)
- A note on the interval function of a disconnected graph (Q1692623) (← links)
