Characterization and representation problems for intersection betweennesses

DOI10.1016/j.dam.2010.12.009zbMath1210.05024OpenAlexW2055823648MaRDI QIDQ628325

Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz 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

zbMATH Keywords

treesshortest pathsbetweenness

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (1)

Conceptual orthospaces -- convexity meets negation

Cites Work

• Tree representations of ternary relations
• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• Simple linear time approximation algorithm for betweenness
• Betweenness parameterized above tight lower bound
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Représentations en arbre de proximités relatives
• Representations of chordal graphs as subtrees of a tree
• Total Ordering Problem
• A Geometric Approach to Betweenness
• Topics in Intersection Graph Theory
• Constraint Satisfaction Problems on Intervals and Lengths
• Ordinal embeddings of minimum relaxation
• Trees, Lattices, Order, and Betweenness

This page was built for publication: Characterization and representation problems for intersection betweennesses