Subpath acyclic digraphs

DOI10.1016/0012-365X(94)00317-CMaRDI QIDQ1918551zbMATH OpenOpenAlexWikidataFDO

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

acyclic intersection digraphsdirected tree

Mathematics Subject Classification ID

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

Review text

The authors give a forbidden subgraph characterization of acyclic digraphs that are the acyclic intersection digraphs of subpaths of a directed tree.

Cites work

• A recognition algorithm for the intersection graphs of paths in trees
• Edge and vertex intersection of paths in a tree
• scientific article; zbMATH DE number 4168705 (Why is no real title available?)
• scientific article; zbMATH DE number 165071 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• Intersection graphs of paths in a tree
• Representation of a finite graph by a set of intervals on the real line
• Representations of chordal graphs as subtrees of a tree
• The edge intersection graphs of paths in a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(2)

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

This page was built for publication: Subpath acyclic digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918551)