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...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 233; pp. 83 - 93
Main Authors Lee, Seung Chul, Choi, Jihoon, Kim, Suh-Ryung, Sano, Yoshio
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 31.12.2017
Elsevier BV
Subjects
Online AccessGet full text

Cover

Loading…