Characterization and representation problems for intersection betweennesses
From MaRDI portal
Recommendations
Cites work
- A Geometric Approach to Betweenness
- A characterisation of rigid circuit graphs
- Algorithmic graph theory and perfect graphs
- Betweenness parameterized above tight lower bound
- Constraint Satisfaction Problems on Intervals and Lengths
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
- Representations of chordal graphs as subtrees of a tree
- Représentations en arbre de proximités relatives
- Simple linear time approximation algorithm for betweenness
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Topics in Intersection Graph Theory
- Total Ordering Problem
- Tree representations of ternary relations
- Trees, Lattices, Order, and Betweenness
Cited in
(7)- Strict betweennesses induced by posets as well as by graphs
- Onp-intersection representations
- Conceptual orthospaces -- convexity meets negation
- scientific article; zbMATH DE number 912985 (Why is no real title available?)
- Finite Sholander trees, trees, and their betweenness
- Interleavings and matchings as representations
- The intersection of the similarity and conjunctivity equivalence classes
This page was built for publication: Characterization and representation problems for intersection betweennesses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628325)