Subtrees of bipartite digraphs---the minimum degree condition

DOI10.1016/S0166-218X(99)00137-7zbMATH Open0936.05046OpenAlexW1968218710MaRDI QIDQ1962047FDOQ1962047

Authors: 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

Recommendations

• Subforests of bipartite digraphs---the minimum degree condition
• Degree sum conditions for oriented forests in digraphs
• Bipartitions of oriented graphs
• Spanning trees in dense directed graphs
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

zbMATH Keywords

bipartite digraphoriented tree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Spanning trees: A survey
• Title not available (Why is that?)
• Oriented Forests in Directed Graphs
• Degree sum conditions for oriented forests in digraphs
• Subforests of bipartite digraphs---the minimum degree condition

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

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