Decompositions of Graphs
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.
1-factor 4-regular A-fold a-labelling A)-design adjacent affine plane arbitrary automorphism Bermond and Sotteau blocks called cardinality chromatic number Colbourn colouring Combinatorial complementary graphs complete bipartite graph complete graph complete m-partite conjecture construct contains Corollary corresponding cyclic decomposition decom decomposable decompositions of complete decompositions of graphs defined denote digraph divisibility condition edges of length elements equivalent exactly example exists finite graph G and G Graceful Graphs graph decompositions graph G graph of order Graph Theory Hamiltonian cycles Hamiltonian decomposition Hamiltonian paths Hanani Harary Hell and Rosa Huang and Rosa hypergraph inequality integers isomorphic factors Kotzig labelling Lemma Let G Mathematics Mathon Nash-Williams non-isomorphic obtained Obviously orthogonal permutation plane of order positive integers problem Proc projective plane Proof proved regular graph resolvable resp self-complementary graph semiwalk simple graphs Steiner triple systems sufficient symmetric Theorem tonian tournaments triangles undirected graph vertex vertex-set Zelinka
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 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.