The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

New to eBooks.com?

Learn more
Browse our categories
  • Bestsellers - This Week
  • Foreign Language Study
  • Pets
  • Bestsellers - Last 6 months
  • Games
  • Philosophy
  • Archaeology
  • Gardening
  • Photography
  • Architecture
  • Graphic Books
  • Poetry
  • Art
  • Health & Fitness
  • Political Science
  • Biography & Autobiography
  • History
  • Psychology & Psychiatry
  • Body Mind & Spirit
  • House & Home
  • Reference
  • Business & Economics
  • Humor
  • Religion
  • Children's & Young Adult Fiction
  • Juvenile Nonfiction
  • Romance
  • Computers
  • Language Arts & Disciplines
  • Science
  • Crafts & Hobbies
  • Law
  • Science Fiction
  • Current Events
  • Literary Collections
  • Self-Help
  • Drama
  • Literary Criticism
  • Sex
  • Education
  • Literary Fiction
  • Social Science
  • The Environment
  • Mathematics
  • Sports & Recreation
  • Family & Relationships
  • Media
  • Study Aids
  • Fantasy
  • Medical
  • Technology
  • Fiction
  • Music
  • Transportation
  • Folklore & Mythology
  • Nature
  • Travel
  • Food and Wine
  • Performing Arts
  • True Crime
  • Foreign Language Books
Trees (Graph theory); Data processing; Congresses

Most popular at the top

  • Design Theoryby D. R. Hughes; F. Piper

    Cambridge University Press 1985; US$ 40.00

    This textbook, first published in 1985, is intended to be an accessible introduction to Design theory for advanced undergraduate and beginning graduate students. more...

  • Spanning Trees and Optimization Problemsby Bang Ye Wu; Kun-Mao Chao

    Taylor and Francis 2004; US$ 115.95

    The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under... more...

  • Chromatic Polynomials And Chromaticity Of Graphsby F M Dong; K M Koh; K L Teo

    World Scientific Publishing Company 2005; US$ 220.00

    This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of... more...

  • Combinatorics of Symmetric Designsby Yury J. Ionin; Mohan S. Shrikhande

    Cambridge University Press 2006; US$ 192.00

    A unified and comprehensive exposition of the theory of symmetric designs with emphasis on recent developments. more...

  • The Construction of Optimal Stated Choice Experimentsby Deborah J. Street; Leonie Burgess

    Wiley 2007; US$ 126.00

    The most comprehensive and applied discussion of stated choice experiment constructions available The Construction of Optimal Stated Choice Experiments provides an accessible introduction to the construction methods needed to create the best possible designs for use in modeling decision-making. Many aspects of the design of a generic stated choice... more...

  • Chromatic Graph Theoryby Gary Chartrand; Ping Zhang

    Taylor and Francis 2008; US$ 115.95

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained... more...

  • Cycles in Graphsby B.R. Alspach; C.D. Godsil

    Elsevier Science 1985; US$ 72.95

    This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems. more...

  • Algorithms in Combinatorial Design Theoryby C.J. Colbourn; M.J. Colbourn

    Elsevier Science 1985; US$ 72.95

    The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs,... more...

  • Combinatorial Designsby A. Hartman

    Elsevier Science 1989; US$ 72.95

    Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations. The Hanani volume is a collection of research... more...

  • Random Treesby Michael Drmota

    Springer 2009; US$ 189.00

    Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. This book provides an introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. more...