|
|||||
|
|
Intersection representation of digraphs in trees with few leaves |
|
| Authors: | In-Jen Lin Malay K. Sen Douglas B. West |
| 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. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 340–353, 1999 |
| Keywords: | leafage digraph intersection representation Ferrers dimension |