scientific article
From MaRDI portal
Publication:3858297
zbMath0424.05033MaRDI QIDQ3858297
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of packing and covering (05B40)
Related Items
Edge-Disjoint Branchings in Temporal Graphs, An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph, Digraph analogues for the Nine Dragon Tree Conjecture, Packing arborescences in random digraphs, The \(b\)-branching problem in digraphs, Covering directed graphs by in-trees, Covering Directed Graphs by In-Trees, On an \(f\)-coloring generalization of linear arboricity of multigraphs, Unnamed Item, Restricted covering of digraphs with arborescences, Packing Arborescences in Random Digraphs, Packing branchings under cardinality constraints on their root sets, Edge-disjoint branchings in temporal digraphs, Optimal Matching Forests and Valuated Delta-Matroids, Blocking unions of arborescences, The Minimum Weight In-Tree Cover Problem, Polyhedra related to a lattice