Skip to main content
SpringerLink
Log in

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

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  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. 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. A. Frank and Z. Király: Graph orientations with edge-connection and parity constraints, Combinatorica 22(1) (2002), 47–70.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. W. Mader: Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ. J. Combinatorics 3 (1982), 63–67.

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Eötvös University MTA-ELTE Egerváry Research Group (EGRES), Pázmány P. s. 1/c, H-1117, Budapest, Hungary

    Erika R. Kovács & László A. Végh

Authors
  1. Erika R. Kovács
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. László A. Végh
    View author publications

    You can also search for this author in PubMed Google Scholar

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–223 (2011). https://doi.org/10.1007/s00493-011-2570-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-011-2570-2

Mathematics Subject Classification (2000)

Search

Navigation