The constructive characterization of (κ,ℓ)-edge-connected digraphs

Abstract

We give a constructive characterization for (κ, ℓ)-edge-connected digraphs, proving a conjecture of Frank.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    J. Edmonds: Edge disjoint branchings, in: Combinatorial Algorithms (B. Rustin, ed.), pages 91–96, Academic Press, New York, 1973.

    Google Scholar 

  2. [2]

    A. Frank: On the orientation of graphs, J. Comb. Theory, Ser. B. 28(3) (1980), 251–261.

    MATH  Article  Google Scholar 

  3. [3]

    A. Frank: Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art ( J. Birge and K. Murty, eds.), pages 34–63, The University of Michigan, 1999.

  4. [4]

    A. Frank: Edge-connection of graphs, digraphs, and hypergraphs; in: More sets, graphs and numbers ( E. Győri, G. Katona, and L. Lovász, eds.), Bolyai Mathematical Society Math. Studies, volume 5, pages 93–142, Springer Verlag, 2006.

  5. [5]

    A. Frank and Z. Király: Graph orientations with edge-connection and parity constraints, Combinatorica 22(1) (2002), 47–70.

    MathSciNet  MATH  Article  Google Scholar 

  6. [6]

    A. Frank and L. Szegő: Constructive characterizations for packing and covering with trees, Discrete Appl. Math. 131(2) (2003), 347–371.

    MathSciNet  MATH  Article  Google Scholar 

  7. [7]

    T. Király: The splitting off operation and its applications, Master’s thesis, Eötvös University, Budapest, 1999, available online at http://www.cs.elte.hu.

    Google Scholar 

  8. [8]

    E. R. Kovács and L. A. Végh: Constructive characterization theorems in combinatorial optimization, RIMS Kôkyûroku Bessatsu 23 (2010), 147–169.

    Google Scholar 

  9. [9]

    W. Mader: Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ. J. Combinatorics 3 (1982), 63–67.

    MathSciNet  MATH  Google Scholar 

  10. [10]

    W. T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc. s1–36 (1961), 221–230.

    MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Erika R. Kovács.

Additional information

Research supported by the Hungarian National Foundation for Scientific Research Grant, OTKA K60802 and TS049788. The second author was also supported by the Siemens-ZIB Scholarship Program.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kovács, E.R., Végh, L.A. The constructive characterization of (κ,ℓ)-edge-connected digraphs. Combinatorica 31, 201 (2011). https://doi.org/10.1007/s00493-011-2570-2

Download citation

Mathematics Subject Classification (2000)

  • 05C75
  • 05C40