Subtrees of bipartite digraphs---the minimum degree condition

DOI10.1016/S0166-218X(99)00137-7zbMath0936.05046OpenAlexW1968218710MaRDI QIDQ1962047

Irmina A. Zioło

Publication date: 20 March 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00137-7

zbMATH Keywords

oriented treebipartite digraph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Spanning trees: A survey ⋮ Oriented Forests in Directed Graphs

Cites Work

• Cycles and paths of many lengths in bipartite digraphs
• Longest paths in digraphs
• Subtrees and subforests of graphs
• Long paths and cycles in oriented graphs

This page was built for publication: Subtrees of bipartite digraphs---the minimum degree condition