Highly edge-connected detachments of graphs and digraphs

Journal of Graph Theory

Volumn 43, Issue 1, 2003, Pages 67-77

  Berg, Alex R ^a   Jackson, Bill ^b   Jordán, Tibor ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037950141     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10104     Document Type: Article

References (9)

1. 1 A. Frank, Augmenting graphs to meet edge‐connectivity requirements, SIAM J Disc Math 5 (1992), 25–53.
2. 2 B. Fleiner, Detachments of vertices of graphs preserving edge‐connectivity, SIAM J Disc Math, submitted.
3. 3 B. Jackson and T. Jordán, Non‐separable detachments of graphs, in press. in J Combin Theory (B).
4. 4 T. Jordán and Z. Szigeti, Detachments preserving local edge‐connectivity of graphs, to appear in SIAM J Disc Math.
5. 5 L. Lovász, Combinatorial problems and exercises, North‐Holland, Amsterdam, 1979.
6. 6 W. Mader, A reduction method for edge‐connectivity in graphs, Annals of Discrete Math 3 (1978), 145–164.
7. 7 W. Mader, Konstruktion aller n‐fach kantenzusammenhängenden Digraphen, Eur J Combin 3 (1982) 63–67.
8. 8 C. St. J. A. Nash‐Williams, Detachments of graphs and generalised Euler trails, in: Surveys in Combinatorics 1985 ( I. Anderson, Ed.), Lond Math Soc Lecture Note Ser 103, Cambridge University Press, Cambridge, 1985. pp. 137–157.
9. 9 C. St. J. A. Nash‐Williams, Connected detachments of graphs and generalized Euler trails, J Lond Math Soc 31 (1985), 17–29.