The constructive characterization of (k,l)-edge-connected digraphs

Kovács, E. R. & Végh, L.ORCID logo (2011). The constructive characterization of (k,l)-edge-connected digraphs. Combinatorica, 31(2), 201-223. https://doi.org/10.1007/s00493-011-2570-2
Copy

We give a constructive characterization for (κ, ℓ)-edge-connected digraphs, proving a conjecture of Frank.
Item Type Article
Copyright holders © 2011 Janos Bolyai Mathematical Society and Springer-Verlag
Departments LSE > Academic Departments > Management
DOI 10.1007/s00493-011-2570-2
Date Deposited 25 Sep 2012
URI https://researchonline.lse.ac.uk/id/eprint/45891

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics