The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
Most popular at the top
Latin Squares
Elsevier Science 1991; US$ 135.00In 1974 the editors of the present volume published a well-received book entitled ``Latin Squares and their Applications''. It included a list of 73 unsolved problems of which about 20 have been completely solved in the intervening period and about 10 more have been partially solved. The present work comprises six contributed chapters and also six... more...
Linear and combinatorial optimization in ordered algebraic structures
Elsevier Science 2011; US$ 137.00Linear and combinatorial optimization in ordered algebraic structures more...
Combinatorial Mathematics
Elsevier Science 2012; US$ 210.00The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory. In publishing this volume, the editors do not intend to discuss all the classical open problems... more...
Combinatorics '84
Elsevier Science 1986; US$ 225.00Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology. The 38 papers in this volume survey the state of the art and report on recent results in Combinatorial Geometries and their applications. Contributors: V. Abatangelo, L. Beneteau, W. Benz, A. Beutelspacher, A. Bichara,... more...
Combinatorics '86
Elsevier Science 2011; US$ 137.00Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science. Topics covered include Galois geometries, blocking sets, affine and projective planes, incidence... more...
Matching Theory
Elsevier Science 1986; US$ 223.00This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic... more...
Convexity and Graph Theory
Elsevier Science 1984; US$ 223.00Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.S.M. Coxeter, L. Danzer, D.G. Larman and J.M. Wills, and equally famous graph-theorists B. Bollobás, P. Erdös and F. Harary. In addition to new results in both geometry and graph theory,... more...









