The phylogeny graphs of doubly partial orders
Boram Park, Yoshio Sano

TL;DR
This paper proves that the phylogeny graph of a doubly partial order is an interval graph and demonstrates that any interval graph can be embedded as an induced subgraph in a phylogeny graph of such an order.
Contribution
It establishes the interval graph property of phylogeny graphs of doubly partial orders and shows the universality of these graphs for all interval graphs.
Findings
Phylogeny graph of a doubly partial order is an interval graph.
Any interval graph can be embedded as an induced subgraph in a phylogeny graph of a doubly partial order.
Abstract
The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph of a digraph is the (simple undirected) graph defined by and , where . In this note, we show that the phylogeny graph of a doubly partial order is an interval graph. We also show that, for any interval graph , there exists an interval graph such that contains the graph as an induced subgraph and that is the phylogeny graph of a doubly…
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.
