Restricted covering of digraphs with arborescences

DOI10.1016/0012-365X(90)90321-8zbMath0701.05022MaRDI QIDQ913812

Mao-cheng Cai

Publication date: 1990

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

zbMATH Keywords

digraphbranchingarborescencespacking and covering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

An algorithm for optimum common root functions of two digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two minimax theorems in graph
• Covering the edge set of a directed graph with trees
• Common root functions of two digraphs
• Arc‐disjoint arborescences of digraphs

This page was built for publication: Restricted covering of digraphs with arborescences