Tree-visibility orders

DOI10.1016/S0012-365X(98)00041-7zbMath0956.05074OpenAlexW1987011877MaRDI QIDQ1584374

Dieter Kratsch, Jean-Xavier Rampon

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00041-7

zbMATH Keywords

interval ordersrecognition algorithmtree-visibility orders

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Chain dominated orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The communication complexity of interval orders
• Partial orders and their convex subsets
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Graph Sandwich Problems

This page was built for publication: Tree-visibility orders