The structure of median graphs
From MaRDI portal
Cited in
(94)- Axiomatic characterization of the interval function of a graph
- Netlike partial cubes III. The median cycle property
- Cube intersection concepts in median graphs
- Transitive, locally finite median graphs with finite blocks
- Netlike partial cubes, V: completion and netlike classes
- Induced cycles in crossing graphs of median graphs
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Networks with Condorcet solutions
- Distance center and centroid of a median graph
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- The retracts of Hamming graphs
- Median graphs and Helly hypergraphs
- Recognizing median graphs in subquadratic time
- On the natural imprint function of a graph
- Clique-gated graphs
- The majority strategy on graphs
- Steiner intervals in graphs
- The median procedure on median graphs
- Quasi-median graphs, their generalizations, and tree-like equalities
- Isometric embeddings of subdivided wheels in hypercubes
- Fast recognition algorithms for classes of partial cubes
- An Euler-type formula for median graphs
- On some characterizations of antipodal partial cubes
- Cube-complements of generalized Fibonacci cubes
- Median algebras
- Intersection graphs of maximal hypercubes
- The median in multidimensional spaces
- Structure of Fibonacci cubes: a survey
- The median function on median graphs and semilattices
- A note on the triameter of graphs
- From modular decomposition trees to rooted median graphs
- Constructing large peak-pit Condorcet domains
- Medians in median graphs and their cube complexes in linear time
- On some properties of antipodal partial cubes
- \(L\)-topological-convex spaces generated by \(L\)-convex bases
- Towards a classification of maximal peak-pit Condorcet domains
- Two-ended regular median graphs
- A cooperative location game based on the 1-center location problem
- Generalized cops and robbers: a multi-player pursuit game on graphs
- Daisy cubes and distance cube polynomial
- Pell graphs
- Condorcet domains, median graphs and the single-crossing property
- Condorcet domains satisfying Arrow's single-peakedness
- Axiomatic characterization of the center function. the case of universal axioms
- Topes of oriented matroids and related structures
- Axiomatic characterization of the interval function of a block graph
- Regular median graphs of linear growth
- Tree-like partial Hamming graphs
- Netlike partial cubes. I. General properties
- Fast recognition of Fibonacci cubes
- Fully gated graphs: Recognition and convex operations
- On median nature and enumerative properties of Fibonacci-like cubes
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Planar median graphs and cubesquare-graphs
- Convex excess in partial cubes
- On M-fuzzifying JHC convex structures and M-fuzzifying Peano interval spaces
- Cubes polynomial and its derivatives
- Θ-graphs of partial cubes and strong edge colorings
- Tiled partial cubes
- Vertex-transitive median graphs of non-exponential growth
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs
- Retracts of products of chordal graphs
- Five axioms for location functions on median graphs
- Strategy-proof location functions on finite graphs
- What do trees and hypercubes have in common?
- Graph theory (algorithmic, algebraic, and metric problems)
- Crossing graphs of fiber-complemented graphs
- Crossing graphs of fiber-complemented graphs
- Injective split systems
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- Symmetric maximal Condorcet domains
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- Metallic cubes
- A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
- Generalized Fibonacci cubes
- Arboreal networks and their underlying trees
- Pseudo-median graphs are join spaces
- Antipodal graphs and oriented matroids
- Horadam cubes
- A decomposition structure of resonance graphs that are daisy cubes
- Distance cube polynomials of Fibonacci and Lucas-run graphs
- On a generalization of median graphs: k-median graphs
- Daisy Hamming graphs
- Coherent domains and improved lower bounds for the maximum size of Condorcet domains
- Weighted Padovan graphs
- Testing whether a subgraph is convex or isometric
- Constructing metric spaces from systems of walls
- The target location function on finite trees
- Not all partial cubes are \(\Theta \)-graceful
- The t-median function on graphs
- On cube-free median graphs
- Ramified rectilinear polygons: coordinatization by dendrons
- On the geodetic number of median graphs
- A characterization of planar partial cubes
This page was built for publication: The structure of median graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252247)
