scientific article; zbMATH DE number 1339499

Publication date: 23 November 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

location theory characterization hypergraphs betweenness semilattices ternary algebras interval structures join geometries median structures meshed graphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Discrete location and assignment (90B80) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph theory (05C99) Helly-type theorems and geometric transversal theory (52A35) Semilattices (06A12) Algebraic structures (08A99) General convexity (52A99)

Related Items

Medians in median graphs and their cube complexes in linear time ⋮ There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Axiomatic characterization of the median function of a block graph ⋮ Induced path transit function, monotone and Peano axioms ⋮ On the natural imprint function of a graph ⋮ Computing median and antimedian sets in median graphs ⋮ The \(t\)-median function on graphs ⋮ Characterizing almost-median graphs ⋮ The majority strategy on graphs ⋮ Maximal proper subgraphs of median graphs ⋮ Uprooted phylogenetic networks ⋮ Peripheral convex expansions of resonance graphs ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ Injective split systems ⋮ Stable outcomes in simple cooperative games ⋮ The median function of a block graph: axiomatic characterizations ⋮ Quadric complexes ⋮ First-order logic axiomatization of metric graph theory ⋮ Planar median graphs and cubesquare-graphs ⋮ Fast recognition algorithms for classes of partial cubes ⋮ Regular median graphs of linear growth ⋮ Tree-like partial Hamming graphs ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity ⋮ Cube-complements of generalized Fibonacci cubes ⋮ Vertex-transitive median graphs of non-exponential growth ⋮ Netlike partial cubes. I. General properties ⋮ On the geodetic number of median graphs ⋮ The All-Paths Transit Function of a Graph ⋮ On the remoteness function in median graphs ⋮ An axiomatization of the median procedure on the \(n\)-cube ⋮ The induced path function, monotonicity and betweenness ⋮ On the role of hypercubes in the resonance graphs of benzenoid graphs ⋮ Convexities related to path properties on graphs ⋮ Two-ended regular median graphs ⋮ Yang-Baxter equation in median algebras ⋮ Unnamed Item ⋮ Recognizing pseudo-median graphs ⋮ On Properties of a Graph that Depend on its Distance Function ⋮ Crossing graphs of fiber-complemented graphs ⋮ The median function on graphs with bounded profiles ⋮ Crossing graphs of fiber-complemented graphs ⋮ Cage-amalgamation graphs, a common generalization of chordal and median graphs ⋮ On the geodesic pre-hull number of a graph ⋮ Triangle path transit functions, betweenness and pseudo-modular graphs ⋮ Netlike partial cubes II. Retracts and netlike subgraphs ⋮ Cube intersection concepts in median graphs ⋮ Daisy cubes and distance cube polynomial ⋮ Unnamed Item ⋮ A poset-based approach to embedding median graphs in hypercubes and lattices ⋮ From modular decomposition trees to rooted median graphs ⋮ Condorcet domains, median graphs and the single-crossing property ⋮ Fibonacci and Lucas \(p\)-cubes ⋮ Transitive, locally finite median graphs with finite blocks ⋮ Netlike partial cubes, V: completion and netlike classes ⋮ Not all partial cubes are \(\Theta \)-graceful ⋮ On median nature and enumerative properties of Fibonacci-like cubes ⋮ What Do Trees and Hypercubes Have in Common? ⋮ The edge general position problem ⋮ Shortcut graphs and groups ⋮ Θ-graphs of partial cubes and strong edge colorings ⋮ A min-max result on catacondensed benzenoid graphs ⋮ Intersection graphs of maximal hypercubes ⋮ Strategy-Proof Location Functions on Finite Graphs ⋮ Axiomatic characterization of the center function. the case of universal axioms ⋮ Axiomatic characterization of the median and antimedian function on a complete graph minus a matching