Independent branchings in acyclic digraphs

DOI10.1016/S0012-365X(98)00338-0zbMath0935.05035MaRDI QIDQ1297456

Andreas Huck

Publication date: 9 August 1999

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

zbMATH Keywords

pathsbranchingsacyclic digraphsspanning trees

Mathematics Subject Classification ID

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

Related Items (5)

Disproof of a conjecture about independent branchings in k‐connected directed graphs ⋮ Spanning trees: A survey ⋮ On packing arborescences in temporal networks ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ A multi-tree routing scheme using acyclic orientations

Cites Work

• Independent trees in graphs
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disproof of a conjecture about independent branchings in k‐connected directed graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent branchings in acyclic digraphs