Intersection representation of digraphs in trees with few leaves
From MaRDI portal
Abstract: The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string of sharp inequalities.
Recommendations
Cites work
- A characterization of interval catch digraphs
- A decomposition theorem for partially ordered sets
- Algorithms for interval catch digraphs
- Circular‐arc digraphs: A characterization
- Connection digraphs and second-order line digraphs
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- On realizable biorders and the biorder dimension of a relation
- Recognizing interval digraphs and interval bigraphs in polynomial time
- The Complexity of the Partial Order Dimension Problem
- The leafage of a chordal graph
Cited in
(5)- On the growth rate of leaf-wise intersections
- On the intractability landscape of digraph intersection representations
- Représentations en arbre de proximités relatives
- scientific article; zbMATH DE number 1185600 (Why is no real title available?)
- Directed Intersection Representations and the Information Content of Digraphs
This page was built for publication: Intersection representation of digraphs in trees with few leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719324)