On Subtrees of Directed Graphs with No Path of Length Exceeding One

DOI10.4153/CMB-1970-063-1MaRDI QIDQ5598934zbMATH OpenFDO

Authors Ron Graham

Publication date 1970

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1970-063-1

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On the number of subtrees for almost all graphs
• scientific article; zbMATH DE number 4168708
• On containment graphs of paths in a tree
• On extremal graphs with no long paths
• Digraphs of directed treewidth one
• On induced subgraphs of trees, with restricted degrees
• scientific article; zbMATH DE number 3912404
• On \(k\)-tree containment graphs of paths in a tree
• Subtrees and subforests of graphs

Cited in

(3)

• Antidirected subgraphs of oriented graphs
• Antidirected trees in dense digraphs
• Semidegree, edge density and antidirected subgraphs (extended abstract)

This page was built for publication: On Subtrees of Directed Graphs with No Path of Length Exceeding One

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