Decompositions of Graphs

Front Cover
Taylor & Francis, Aug 31, 1990 - Computers - 248 pages
0 Reviews
This nice text (twenty years in the writing, published posthumously) would serve well to introduce graduate students (those who can afford it ) to a rich and important class of graph-theoretic problems and concepts. Fifteen short chapters (under three broad topical heads), to each of which are attac
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Section 1
3
Section 2
15
Section 3
19
Section 4
25
Section 5
47
Section 6
49
Section 7
57
Section 8
77
Section 12
117
Section 13
129
Section 14
133
Section 15
141
Section 16
165
Section 17
175
Section 18
185
Section 19
189

Section 9
79
Section 10
99
Section 11
111
Section 20
198
Section 21
203

Common terms and phrases

Popular passages

Page 231 - The number of open chains of length three and the parity of the number of open chains of length k In self-complementary graphs.
Page 208 - An application of the solution of Kirkman's schoolgirl problem: the decomposition of the symmetric oriented complete graph into 3-circuits, Discrete Math.
Page 233 - C. Huang. Another class of balanced graph designs: balanced circuit designs. Discrete Math. 12 (1975): 269-293. 69. J. Schönheim. Partition of the edges of the complete directed graph into 4-cycles. Discrete Math. 11 (1975): 67-70, 70. D. Sotteau. Decompositions of Km,„ (Kż „) into cycles (circuits) of length 2k.

References to this book

One-Factorizations
W.D. Wallis
Limited preview - 1996
All Book Search results »