Elimination of Local Bridges

Vertices of degree different from two in a graph K are called main vertices of K, and paths joining these vertices are branches of K. Let K be a subgraph of G. It is shown that if G is 3-connected (modulo K), then it is possible to replace branches of K by other branches joining the same pairs of main vertices of K such that G has no bridges with respect to the new subgraph whose vertices of attachment all lie on a single branch of K. A linear time algorithm is presented that either performs such a task, or finds a Kuratowski subgraph K 5 or K 3;3 in a subgraph of G formed by a branch e and those bridges of K in G that are attached only to the branch e. Supported in part by the Ministry of Science and Technology of Slovenia, Research Project J1-7036. 1 Introduction Let K be a subgraph of a simple graph G. A K-bridge (or a relative Kcomponent) is a subgraph of G which is either an edge e 2 E(G)nE(K) (together with its endpoints) with both endpoints in K, or it is a connected co..

EXAMINE (EXploitation of Aphid Monitoring In Europe) : an European thematic network for the study of global change impacts on aphids

vo

Examine (Exploitation of aphid monitoring in Europe) : an E.U. thematic network for the study of global change impacts on aphids

vo

Environmental change, life cycle traits and aphid phenology

vo