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

Posted by

By Okamura H.

Show description

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

Similar graph theory books

Algebraic Combinatorics: Walks, Trees, Tableaux, and More (Undergraduate Texts in Mathematics)

Written by means of one of many prime specialists within the box, Algebraic Combinatorics is a special undergraduate textbook that might organize the subsequent new release of natural and utilized mathematicians. the combo of the author’s broad wisdom of combinatorics and classical and sensible instruments from algebra will encourage encouraged scholars to delve deeply into the interesting interaction among algebra and combinatorics.

A Mathematical Theory of Large-scale Atmosphere/ocean Flow

This booklet counteracts the present model for theories of "chaos" and unpredictability through describing a idea that underpins the incredible accuracy of present deterministic climate forecasts, and it means that additional advancements are attainable. The e-book does this through creating a detailed hyperlink among a thrilling new department of arithmetic referred to as "optimal transportation" and latest classical theories of the large-scale surroundings and ocean move.

Topics in Algebraic Graph Theory (Encyclopedia of Mathematics and its Applications)

The quickly increasing sector of algebraic graph thought makes use of various branches of algebra to discover numerous facets of graph conception: linear algebra (for spectral idea) and team thought (for learning graph symmetry). those components have hyperlinks with different parts of arithmetic, similar to common sense and harmonic research, and are more and more getting used in such components as machine networks the place symmetry is a crucial function.

Chemical Graph Theory

Re-creation! thoroughly Revised and UpdatedChemical Graph conception, 2d variation is a totally revised and up to date variation of a very hot ebook that has been favourite due to the fact that its e-book in 1983. This detailed booklet deals a simple creation to the dealing with of molecular graphs - mathematical diagrams representing molecular constructions.

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

Example text

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.

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. Graphs and Comb. I, 81-89 (1985) 5.

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.

Download PDF sample

Rated 4.58 of 5 – based on 18 votes