This volume contains selected papers presented at the Spring School and International Conference on Combinatorics. Topics discussed include: Enumeration, Design, Graphs, Hypergraphs and Combinatorial Optimization, etc. Covering a broad range, this book should appeal to a wide spectrum of researchers in combinatorics and graph theory.
Partial n-solution to the modular n-queens problem II, M.-R. Chen et al; power-type generating functions and asymptotic expansions, L.C. Hsu; enumeration using cycle indices and marks, E.K. Lloyd; design patterns of imcomplete block designs for parallel line assays, P.D. Puri and L.R. Gupta; research about the structure of EGD/(21-1)-PBIB designs, J.-Y. Xu; strongly extendable graphs I (Z.-Q. Chen; group generation of self-complementary graphs, R. Figueroa and R.E. Giudici; decomposition of Kn into degenerate graphs, R. Klein and J. Schoenheim; homomorphism on N-dimensional line digraphs, X.-L. Li and F.-J. Zhang; total chromatic number of graphs G having maximum degree G - 3, H.P. Yap; on optimal network with quasi-full Steiner topology, J.-Y. Ding; a linear programming interpretation of Lemke's scheme I, R. Zhou; a general scheme for solving linear complementary problems in the setting of oriented matroids, T. Terlaky and Z.-M. Wang. (Part contents).