By Okamura H.

**Read Online or Download 2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs PDF**

**Similar graph theory books**

**Networks and Graphs: Techniques and Computational Methods**

Dr Smith the following offers crucial mathematical and computational principles of community optimization for senior undergraduate and postgraduate scholars in arithmetic, computing device technological know-how and operational examine. He exhibits how algorithms can be utilized for locating optimum paths and flows, making a choice on timber in networks, and optimum matching.

- Graph Theory in Paris. Proc. conf. in memory of Berge
- Transfiniteness: For Graphs, Electrical Networks, and Random Walks
- Combinatorics, Probability and Computations on Groups
- A Kaleidoscopic View of Graph Colorings (SpringerBriefs in Mathematics)
- Fuzzy Graphs and Fuzzy Hypergraphs (Studies in Fuzziness and Soft Computing)

**Extra resources for 2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs**

**Sample text**

8). Thus Xx = DIUD2U{vl} = {vt,v2,z}. 6) e(z, X 2 ) < ~ and e(z, v l) < ~, a contradiction. 11), V(P*) = {u~, x, y, u2} for some x ~ X2 and y e X 1 . 23), there is (k + 3)-set Z with Z f ) ( T U {x,y})-(vl, u2, x}. e(X1 tq Z) >_ k + 4, and e(X1 tq Z) > k + 4 since X1 and X2 are minimal (k + 3)-sets, contrary to Lemma 2. 25), V(G) - T is an independent set. 22). 6). 11). This completes the proof of Propositions A, B and C and Theorem 1. [] Acknowledgment. The author would like to thank the referee for his helpful comments.

Comb. Theory Ser. B 37, 151172 (1984) 6. : Paths in k-edge-connected graphs. J. Comb. Theory Ser. B 45, 345-355 (1988) 7. : Cycles containing three consecutive edges in 2k-edge-connected graphs, Topics in Combinatorics and Graph Theory (eds. R. Bodendiek and R. Henn), PhysieaVerlag Heidelberg (1991), 549-553 8. : 2-reducible cycles containing two specified edges in (2k + 1)-edgeconnected graphs, Contemporary Math.

Counterexamples to a conjecture of Mader about cycles through specified vertices in n-edge-connected graphs. Graphs and Comb. 8, 253-258 (1992) 3. : A reduction method for edge-connectivity in graphs. Ann. Discrete Math. 3, 145-164 (1978) 4. : Paths in graphs, reducing the edge-connectivity only by two. Graphs and Comb. I, 81-89 (1985) 5. : Paths and edge-connectivity in graphs. J. Comb. Theory Ser. B 37, 151172 (1984) 6. : Paths in k-edge-connected graphs. J. Comb. Theory Ser. B 45, 345-355 (1988) 7.