What Do Trees and Hypercubes Have in Common?
From MaRDI portal
Publication:5506781
DOI10.1007/978-3-319-31940-7_10zbMath1352.05158OpenAlexW2534518427MaRDI QIDQ5506781
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_10
Related Items (4)
An ABC-problem for location and consensus functions on graphs ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ The edge general position problem ⋮ Axiomatic characterization of the center function. the case of universal axioms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An axiomatization of the median procedure on the \(n\)-cube
- Median graphs, parallelism and posets
- Medians in median graphs
- From copair hypergraphs to median graphs with latent vertices
- A fixed cube theorem for median graphs
- The structure of median graphs
- Median graphs and Helly hypergraphs
- An axiomatic characterization of some locations in trees
- The majority strategy on graphs
- The median procedure on median graphs
- A tight axiomatization of the median procedure on median graphs
- The median function on median graphs and semilattices
- Distance-preserving subgraphs of hypercubes
- An Axiomatic Approach to Location on Networks
- Metric Ternary Distributive Semi-Lattices
- Retracts of hypercubes
- n‐cubes and median graphs
- Median Algebra
- Median Graphs and Triangle-Free Graphs
- Quasi‐median graphs and algebras
- Axiomatic Consensus Theory in Group Choice and Biomathematics
- Five axioms for location functions on median graphs
This page was built for publication: What Do Trees and Hypercubes Have in Common?