Characterization and representation problems for intersection betweennesses
From MaRDI portal
Publication:628325
DOI10.1016/J.DAM.2010.12.009zbMATH Open1210.05024OpenAlexW2055823648MaRDI QIDQ628325FDOQ628325
Authors: Dieter Rautenbach, Vinícius F. dos Santos, Philipp M. Schäfer, Jayme L. Szwarcfiter 
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.009
Recommendations
Cites Work
- Tree representations of ternary relations
- Topics in Intersection Graph Theory
- Algorithmic graph theory and perfect graphs
- Betweenness parameterized above tight lower bound
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representations of chordal graphs as subtrees of a tree
- Constraint Satisfaction Problems on Intervals and Lengths
- Total Ordering Problem
- Trees, Lattices, Order, and Betweenness
- A characterisation of rigid circuit graphs
- A Geometric Approach to Betweenness
- Simple linear time approximation algorithm for betweenness
- Représentations en arbre de proximités relatives
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
Cited In (7)
- Onp-intersection representations
- Strict betweennesses induced by posets as well as by graphs
- Conceptual orthospaces -- convexity meets negation
- Title not available (Why is that?)
- 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)
