On the phylogeny graphs of degree-bounded digraphs
Hefner et al. (1991) characterized acyclic digraphs each vertex of which has indegree and outdegree at most two and whose competition graphs are interval. They called acyclic digraphs each vertex of which has indegree and outdegree at most two (2,2) digraphs. In this paper, we study the phylogeny gr...
Saved in:
Published in | Discrete Applied Mathematics Vol. 233; pp. 83 - 93 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
31.12.2017
Elsevier BV |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!