All Stories

  1. Dyadic representations of graphs
  2. Axiomatic characterization of the center function. The case of non-universal axioms
  3. axiomatic characterization of the interval function of a disconnected graph
  4. Graphs constructible from cycles and complete graphs
  5. Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
  6. Axiomatic characterization of the center function. The case of universal axioms
  7. An ABC-problem for location and consensus on graphs
  8. Axiomatic characterization of the interval function of a block graph
  9. On EOQ cost models with arbitrary purchase and transportation costs
  10. Guides and shortcuts in graphs
  11. An axiomatic approach to location functions on finite metric spaces
  12. A tight axiomatization of the median procedure on median graphs
  13. Path-neigborhood graphs
  14. An axiomatization of the median procedure on the
  15. The ℓp-function on trees
  16. The induced path function, monotonicity and betweenness
  17. Axiomatic characterization of the interval function of a graph
  18. The t-median function on graphs
  19. Analysing container flows in the Caribbean
  20. Convexities related to path properties on graphs
  21. Constant tolerance intersection graphs of subtrees of a tree
  22. Graphs with only caterpillars as spanning trees
  23. Spherical and Clockwise Spherical Graphs
  24. Induced Path Transit Function, Betweenness and Monotonicity
  25. Signpost Systems and Their Underlying Graphs
  26. The median function on distributive semilattices
  27. Partial Cubes and Crossing Graphs
  28. Intersection graphs on trees with a tolerance
  29. Quasi-median graphs and algebras
  30. Pseudo-median graphs are join spaces
  31. Julius Petersen's theory of regular graphs
  32. Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication
  33. Metric characterization of parity graphs
  34. Regular pseudo-median graphs
  35. Pseudo-modular graphs
  36. Distance-hereditary graphs
  37. Interval-regular graphs of diameter two
  38. Infinite median graphs, (0, 2)-graphs, and hypercubes
  39. The Number of Edges in a k–Helly Hypergraph
  40. Interval-regular graphs
  41. n-cubes and median graphs
  42. (0,λ)-graphs and n-cubes
  43. Median graphs and Helly hypergraphs
  44. The structure of median graphs