Citation
Ij. Lin et al., Intersection representation of digraphs in trees with few leaves, J GRAPH TH, 32(4), 1999, pp. 340-353
Citations number
18
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024
→ ACNP
Volume
32
Issue
4
Year of publication
1999
Pages
340 - 353
Database
ISI
SICI code
0364-9024(199912)32:4<340:IRODIT>2.0.ZU;2-3
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 th
e leaf age in terms of other parameters (including Ferrers dimension), obta
ining a string of sharp inequalities. (C) 1999 John Wiley & Sons, Inc. J Gr
aph Theory 32: 340-353, 1999.