Some Theorems on Detachments Preserving Local-Edge-Connectivity

Electronic Notes in Discrete Mathematics

Volumn 24, Issue , 2006, Pages 173-180

  Fukunaga, Takuro ^a   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

detachment; edge splitting; Eulerian; graphs; local edge connectivity

Indexed keywords

EID: 33745857653     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2006.06.041     Document Type: Article

References (8)

1. A. R. Berg, B. Jackson and T. Jordán, Highly edge-connected detachments of graphs and digraphs, Journal of Graph Theory 43 (2003), pp. 67-77.
2. B. Fleiner, Detachment of vertices of graphs preserving edge-connectivity, SIAM Journal on Discrete Mathematics 18 (2005), pp. 581-591.
3. T. Fukunaga and H. Nagamochi, Eulerian detachments with local-edgeconnectivity, Tech. Rep. 2006-006, Department of Applied Mathematics and Physics, Kyoto University, May 2006.
4. T. Fukunaga and H. Nagamochi, Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, Tech. Rep. 2005-010, Department of Applied Mathematics and Physics, Kyoto University, September 2005.
5. T. Jordán and Z. Szigeti, Detachments preserving local edge-connectivity of graphs, SIAM Journal on Discrete Mathematics 17 (2003), pp. 72-87.
6. W. Mader, A reduction method for edge-connectivity in graphs, Annals of Discrete Mathematics 3 (1978), pp. 145-164.
7. H. Nagamochi, A detachment algorithm for inferring a graph from path frequency, Proc. 12th International Computing and Combinatorics Conference, Taipei, Taiwan (2006) (to appear).
8. C. S. J. A. Nash-Williams, Connected detachments of graphs and generalized Euler trails, Journal of London Mathematical Society 31 (1985), pp. 17-29.