Contents

Ars Combinatoria

  • Research article

Subtree Acyclic Digraphs

Frank Harary1, Jerald A.Kabell2, ER. McMorris3
1 Department of Computer Science New Mexico State University Las Cruces, NM 88003
2Department of Computer Science Central Michigan University Mount Pleasant, MI 48859
3Department of Mathematics University of Louisville Louisville, KY 40292
  • Published: 31/12/1992

Abstract

We characterize those digraphs that are the acyclic intersection digraphs of subtrees of a directed tree. This is accomplished using the semilattice of subtrees of a rooted tree and the reachability relation.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Frank Harary, Jerald A.Kabell, ER. McMorris. Subtree Acyclic Digraphs[J], Ars Combinatoria, Volume 034. 93-95. DOI: .