Subpath acyclic digraphs

DOI10.1016/0012-365X(94)00317-CzbMath0851.05054OpenAlexW2059912682WikidataQ126743678 ScholiaQ126743678MaRDI QIDQ1918551

Fred R. McMorris, Henry Martyn Mulder

Publication date: 21 November 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00317-c

zbMATH Keywords

directed treeacyclic intersection digraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Recognition and characterization of chronological interval digraphs ⋮ Strict chordal and strict split digraphs

Cites Work

• The edge intersection graphs of paths in a tree
• Edge and vertex intersection of paths in a tree
• Intersection graphs of paths in a tree
• A recognition algorithm for the intersection graphs of paths in trees
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Representations of chordal graphs as subtrees of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subpath acyclic digraphs