Antistrong digraphs
Authors:
- Jørgen Bang-JensenJBJørgen Bang-Jensen
- Stéphane BessySBStéphane Bessy
- Bill JacksonBJBill Jackson
- Matthias KriesellMKMatthias Kriesell
- 1 January 2017
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 122, 68-90
Abstract
No abstract availableKeywords
Funding Information
- IML
- Danish Research Council (1323-00178B)
This publication has 7 references indexed in Scilit:
- Arc-disjoint spanning sub(di)graphs in digraphsTheoretical Computer Science, 2012
- A rooted-forest partition with uniform vertex demandJournal of Combinatorial Optimization, 2010
- Decomposing k-ARc-Strong Tournaments Into Strong Spanning SubdigraphsCombinatorica, 2004
- Connected Detachments of Graphs and Generalized Euler TrailsJournal of the London Mathematical Society, 1985
- Signed graphsDiscrete Applied Mathematics, 1982
- On Two Problems in the Generation of Program Test PathsIEEE Transactions on Software Engineering, 1976
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965