Subforests of bipartite digraphs---the minimum degree condition

DOI10.1016/S0012-365X(00)00453-2MaRDI QIDQ5959113zbMATH OpenOpenAlexWikidataFDO

Authors Irmina A. Zioło

Publication date 30 July 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00453-2

zbMATH Keywords

bipartite digraphoriented forestoriented trees

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Subtrees of bipartite digraphs---the minimum degree condition
• scientific article; zbMATH DE number 2104713
• A minimum degree result for disjoint cycles and forests in graphs
• Degree conditions for forests in graphs
• Subtrees and subforests of graphs
• On Subgraphs of the Complete Bipartite Graph
• The minimal number of subtrees with a given degree sequence
• Subgraphs of minimal degree \(k\)
• Minimum degree conditions for large subgraphs
• Degree conditions on copies of forests in graphs

Cited in

(3)

• Degree sum conditions for oriented forests in digraphs
• Subtrees of bipartite digraphs---the minimum degree condition
• Spanning trees: A survey

This page was built for publication: Subforests 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 Q5959113)