Our search has the following Google-type functionality:

If you use '+' at the start of a word, that word will be present in the search results.

*eg. Harry +Potter*

*Search results will contain 'Potter'.*

If you use '-' at the start of a word, that word will be absent in the search results.

*eg. Harry -Potter*

*Search results will not contain 'Potter'.*

If you use 'AND' between 2 words, then both those words will be present in the search results.

*eg. Harry AND Potter*

*Search results will contain both 'Harry' and 'Potter'.*

NOTE: AND will only work with single words not phrases.

If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.

*eg. 'Harry OR Potter'*

*Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.*

NOTE: OR will only work with single words not phrases.

If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).

*eg. 'Harry NOT Potter'*

*Search results will not contain 'Potter'.*

NOTE: NOT will only work with single words not phrases.

If you use double quotation marks around words, those words will be present in that order.

*eg. "Harry Potter"*

*Search results will contain 'Harry Potter', but not 'Potter Harry'.*

NOTE: "" cannot be combined with AND, OR & NOT searches.

If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).

*eg. 'Pot*er'*

*Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.*

- Sort Results By

Graph theory goes back several centuries and revolves around the study of graphs--mathematical structures showing relations... [more]

Combinatorics is a large branch of mathematics involving the counting, selecting, and arranging of objects. Robin Wilson explores... [more]

Presented in 1962-63 by several experts at University College, London, these lectures include Extremal Problems in Graph... [more]

This book presents a wide-ranging variety of mathematical argument to give insights into the small world model, the preferential... [more]

The main idea of this approach is to start from relatively easy problems and step-by-step increase the level of difficulty... [more]

Concise but detailed and thorough treatment discusses rudiments of simplex method for solving optimization problems. Sufficient... [more]

Suitable for self-study or a first course in combinatorics at the undergraduate level, this title focuses on counting problems... [more]

Aimed at the mathematically traumatized, this text offers nontechnical coverage of graph theory, with exercises. Discusses... [more]

The Art of Proving Binomial Identities accomplishes two goals: (1) It provides a unified treatment of the binomial coefficients,... [more]

The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and... [more]

Volume of geometric objects was studied by ancient Greek mathematicians. In discrete geometry, a relatively new branch of... [more]

Game Theory: A Modeling Approach quickly moves readers through the fundamental ideas of the subject to enable them to engage... [more]

The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation... [more]

The subject of this book is truly original. By encoding of algebraic equations into graphs-originally a purely pedagogical... [more]

The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation... [more]

Dealing with graph theory, this book includes chapters on measurement and analytic graph theory. It takes a comprehensive... [more]

Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory. It presents an overview... [more]

Introduction to Chemical Graph Theory is a concise introduction to the main topics and techniques in chemical graph theory,... [more]

Through three editions, Cryptography: Theory and Practice, has been embraced by instructors and students alike. It offers... [more]

Year after year, PRECALCULUS: FUNCTIONS AND GRAPHS leads the way in helping students like you succeed in their Precalculus... [more]

Network science is a rapidly emerging field of study that encompasses mathematics, computer science, physics, and engineering.... [more]

A CRC title, part of the Taylor & Francis imprint, a member of the Taylor & Francis Group, the academic division of T&F Informa... [more]

Graph Searching Games and Probabilistic Methods is the first book that focuses on the intersection of graph searching games... [more]

This book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial... [more]

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with... [more]