Equivalence of the filament and overlap graphs of subtrees of limited trees
Jessica Enright, Lorna Stewart

TL;DR
This paper establishes the equivalence of various classes of subtree overlap and filament graphs, generalizing known results and linking them to complements of cochordal-mixed graphs.
Contribution
It extends the known equivalences between subtree overlap and filament graphs to many more classes, unifying them with cochordal-mixed graph complements.
Findings
Many classes of subtree overlap and filament graphs are equivalent.
These classes are characterized as complements of cochordal-mixed graphs.
Results generalize previous specific cases.
Abstract
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In this paper, we show the equivalence of many more classes of subtree overlap and subtree filament graphs, and equate them to classes of complements of cochordal-mixed graphs. Our results generalize the previously known results mentioned above.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Plant biochemistry and biosynthesis · Lignin and Wood Chemistry
