Read e-book online 2-reducible cycles containing three consecutive edges in (2k PDF

By Okamura H.

Show description

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

Best graph theory books

Wolfram Pohlers (auth.)'s Proof Theory: An Introduction PDF

Even if this is often an introductory textual content on evidence conception, such a lot of its contents isn't really present in a unified shape in different places within the literature, other than at a really complex point. the center of the publication is the ordinal research of axiom structures, with specific emphasis on that of the impredicative concept of straightforward inductive definitions at the usual numbers.

Wolfgang Karl Härdle, Zdeněk Hlávka's Multivariate Statistics - Exercises and Solutions PDF

This publication provides the instruments and ideas of multivariate facts research. It demonstrates the applying of straightforward calculus and simple multivariate tools in genuine lifestyles events, and lines greater than two hundred solved routines.

New PDF release: Schaum's Outline of Graph Theory: Including Hundreds of

Complicated Textbooks? overlooked Lectures? now not adequate Time? thankfully for you, there is Schaum's Outlines. greater than forty million scholars have depended on Schaum's to aid them achieve the study room and on checks. Schaum's is the major to speedier studying and better grades in each topic. each one define provides all of the crucial path details in an easy-to-follow, topic-by-topic structure.

Additional info for 2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs

Example text

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. References 1. : On a theorem of Mader. Discrete Mathematics 101, 49-57 (1992) 2. : 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.

Then there are disjoint D~, D2 c_ V(G) - (X2 + vl) such that V(G) = Dx O D 2 (3 X 2 (J {01 }, e(D1, D2) --- 0, z 6 D1 and u 2 ~ D 2. 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).

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. : 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.

Download PDF sample

2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs by Okamura H.


by James
4.4

Rated 4.39 of 5 – based on 23 votes