scientific article; zbMATH DE number 3697163
From MaRDI portal
Publication:3890733
Cited in
(only showing first 100 items - show all)- Cover-incomparability graphs of posets
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Axiomatic characterization of the interval function of a graph
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Netlike partial cubes III. The median cycle property
- Cube intersection concepts in median graphs
- Netlike partial cubes, V: completion and netlike classes
- Distance monotonicity and a new characterization of Hamming graphs
- Steiner intervals, geodesic intervals, and betweenness
- Induced cycles in crossing graphs of median graphs
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Networks with Condorcet solutions
- Distance-hereditary graphs
- Pseudo-modular graphs
- On local convexity in graphs
- A fixed cube theorem for median graphs
- Fixed hypercube embedding
- Isometric embeddings in Hamming graphs
- Constructions of ranked posets
- Hereditary modular graphs
- Convex sets in graphs. II: Minimal path convexity
- Dismantling absolute retracts of reflexive graphs
- A Helly theorem in weakly modular space
- Invariant Hamming graphs in infinite quasi-median graphs
- Another characterization of hypercubes
- Superextensions and the depth of median graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- The retracts of Hamming graphs
- Distance monotone graphs and a new characterization of hypercubes
- A characterization of bipartite graphs associated with BIB-designs with =1
- Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis
- Recognizing median graphs in subquadratic time
- Metric coset schemes revisited
- Computing a median point of a simple rectilinear polygon
- A new characterization of median graphs
- On the natural imprint function of a graph
- Clique-gated graphs
- Characterization of products of trees and grids
- Generalized hypercubes and (0, 2)-graphs
- The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree
- Trees, taxonomy, and strongly compatible multi-state characters
- The majority strategy on graphs
- Steiner intervals in graphs
- Retracts of infinite Hamming graphs
- The median procedure on median graphs
- Quasi-median graphs, their generalizations, and tree-like equalities
- Fast recognition algorithms for classes of partial cubes
- Decomposition and \(l_1\)-embedding of weakly median graphs
- An Euler-type formula for median graphs
- g-convex weight sequences
- Generalized Hamming graphs: some new results
- Trees with unique least central subtrees
- A note on the interval function of a disconnected graph
- Cube-complements of generalized Fibonacci cubes
- Steiner convex sets and Cartesian product
- Axiomatic characterization of the center function. The case of non-universal axioms
- Convexities related to path properties on graphs
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Some properties of \(M\)-fuzzifying convexities induced by \(M\)-orders
- On F-geodetic graphs
- Absolute retracts of bipartite graphs
- A min-max result on catacondensed benzenoid graphs
- Intervals and steps in a connected graph
- Induced path transit function, monotone and Peano axioms
- A remark on Mulder's conjecture about interval-regular graphs
- Cartesian products of block graphs
- Characterization of Laborde-Mulder graphs (extended odd graphs)
- Stable graphs for a family of endomorphisms
- A multifacility location problem on median spaces
- A characterization of cube-hypergraphs
- On posets of \(m\)-ary words
- Median sets and median number of a graph
- Graphs of some CAT(0) complexes
- Algebraic characterisation of relatively hyperbolic special groups
- Medians in median graphs and their cube complexes in linear time
- Neighbor connectivity of \(k\)-ary \(n\)-cubes
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- A counterexample to Thiagarajan's conjecture on regular event structures
- Axiomatic characterization of the interval function of a bipartite graph
- Computing the hull number in -convexity
- Distance and routing labeling schemes for cube-free median graphs
- A cooperative location game based on the 1-center location problem
- Cycle-regular graphs
- On the Carathéodory and exchange numbers of geodetic convexity in graphs
- A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\)
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Geodetic number of powers of cycles
- 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
- Competitive location on a network
- The interval function of a connected graph and road systems
- The algebra of metric betweenness. I: Subdirect representation and retraction
- Intervals and convex sets in strong product of graphs
- Computing median and antimedian sets in median graphs
- Axiomatic characterization of the interval function of a block graph
- The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- Tree-like partial Hamming graphs
- A characterization of the interval distance monotone graphs
- Netlike partial cubes. I. General properties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890733)
