Intersection representation of digraphs in trees with few leaves

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<340::AID-JGT3>3.0.CO;2-R" /><340::AID-JGT3>3.0.CO;2-R 10.1002/(SICI)1097-0118(199912)32:4<340::AID-JGT3>3.0.CO;2-RzbMath0938.05045arXivmath/9807165OpenAlexW2950093600MaRDI QIDQ4719324

Injen Lin, Douglas B. West, Malay Kr. Sen

Publication date: 15 February 2000

Full work available at URL: https://arxiv.org/abs/math/9807165

zbMATH Keywords

digraphdominating setFerrers dimensionintersection representationleaveshost tree

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• On realizable biorders and the biorder dimension of a relation
• A characterization of interval catch digraphs
• Connection digraphs and second-order line digraphs
• Algorithms for interval catch digraphs
• Recognizing interval digraphs and interval bigraphs in polynomial time
• A decomposition theorem for partially ordered sets
• The Complexity of the Partial Order Dimension Problem
• Circular‐arc digraphs: A characterization
• The leafage of a chordal graph
• Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders

This page was built for publication: Intersection representation of digraphs in trees with few leaves