Antistrong digraphs

Bang-Jensen, 2009 Bang-Jensen, 2004, Decomposing k-arc-strong tournaments into strong spanning subdigraphs, Combinatorica, 24, 331, 10.1007/s00493-004-0021-z Bang-Jensen, 2012, Arc-disjoint spanning sub(di)graphs in digraphs, Theoret. Comput. Sci., 438, 48, 10.1016/j.tcs.2012.03.003 Chartrand, 1997, Anticonnected digraphs, Util. Math., 51, 41 Edmonds, 1965, Minimum partition of a matroid into independent sets, J. Res. Natl. Bur. Stand., B Math. Math. Phys., 69, 67, 10.6028/jres.069B.004 Edmonds, 1970, Submodular functions, matroids, and certain polyhedra, 69 Frank, 2011, Connections in Combinatorial Optimization, vol. 38 Gabow, 1976, On two problems in the generation of program test paths, IEEE Trans. Softw. Eng., 2, 227, 10.1109/TSE.1976.233819 Katoh, 2012, A rooted-forest partition with uniform vertex demand, J. Comb. Optim., 24, 67, 10.1007/s10878-010-9367-x Nash-Williams, 1985, Connected detachments of graphs and generalized Euler trails, J. Lond. Math. Soc., 31, 17, 10.1112/jlms/s2-31.1.17 Whiteley, 1996, Some matroids from discrete geometry, vol. 197, 171 Zaslavski, 1982, Signed graphs, Discrete Appl. Math., 4, 47, 10.1016/0166-218X(82)90033-6