| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419744 | Discrete Applied Mathematics | 2009 | 8 Pages |
For a graph GG, a detachment operation at a vertex transforms the graph into a new graph by splitting the vertex into several vertices in such a way that the original graph can be obtained by contracting all the split vertices into a single vertex. A graph obtained from a given graph GG by applying detachment operations at several vertices is called a detachment of graph GG. While detachment operations may decrease the connectivity of graphs, there are several works on conditions for preserving the connectivity. In this paper, we present necessary and sufficient conditions for a given graph/digraph to have an Eulerian detachment that satisfies a given local edge-connectivity requirement. We also discuss conditions for the detachment to be loopless.
