Linear arboricity of digraphs
Authors:
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The linear arboricity of some regular graphsJournal of Graph Theory, 1984
- NP-completeness of some problems of partitioning and covering in graphsDiscrete Applied Mathematics, 1984
- Covering and packing in graphs IV: Linear arboricityNetworks, 1981
- Path number of bipartite digraphsJournal of Combinatorial Theory, Series B, 1980
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- COVERING AND PACKING IN GRAPHS, I.Annals of the New York Academy of Sciences, 1970
- A formal system for information retrieval from filesCommunications of the ACM, 1970