Download 2-reducible cycles containing three consecutive edges in (2k by Okamura H. PDF

By Okamura H.

Show description

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

Similar graph theory books

Kummer's Quartic Surface

The speculation of surfaces has reached a definite degree of completeness and significant efforts be aware of fixing concrete questions instead of constructing additional the formal conception. lots of those questions are touched upon during this vintage quantity, resembling the type of quartic surfaces, the outline of moduli areas for abelian surfaces, and the automorphism crew of a Kummer floor.

Schaum's Outline of Theory and Problems of Combinatorics including concepts of Graph Theory

Complicated Textbooks? neglected Lectures? tricky try out Questions? thankfully for you, there is Schaum's Outlines. greater than forty million scholars have depended on Schaum's to aid them reach the school room and on assessments. Schaum's is the most important to speedier studying and better grades in each topic.

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

Example text

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.

2-reducible cycles containing two specified edges in (2k + 1)-edgeconnected graphs, Contemporary Math.

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

Rated 4.75 of 5 – based on 17 votes