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).
Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.
Arthur Benjamin is professor of mathematics at Harvey Mudd College. Gary Chartrand is professor emeritus of mathematics at Western Michigan University. Ping Zhang is professor of mathematics at Western Michigan University.
One of Choice's Outstanding Academic Titles for 2015 The Fascinating World of Graph Theory shows its pedagogic value. Traditional courseware develops subject matter from the bottom on up, going from basic definitions to the more complex. [This book] is different, not starting with the simplest structures or algorithms but with interesting problems to be solved, puzzles that use graphs and networks... [It is] readable and 'student-friendly'--more so than the typical math textbook. --New York Journal of Books [The authors] have set out to make graph theory not only accessible to people with a limited mathematics background, but also to make it interesting. They have--by virtue of very clear writing, combined with a greater-than-usual emphasis on the historical and personal side of the subject--succeeded admirably. --MAA Reviews The book is written masterfully; the narrative in each chapter flows naturally, engagingly... [I]t's a popular but also comprehensive introduction into graph theory. --Alexander Bogomolny, Cut the Knot blog A fun and interesting tour of graph theory, leaving each visitor with a feeling of accomplishment and a satisfying understanding of this unusual mathematical world... This is an entertaining book for those who enjoy solving problems, plus readers will learn about some powerful mathematical ideas along the way! --Choice Here is a book with an enjoyable mix of mathematics and its applications, spiced with liberal amounts of history and anecdote... The value of books like this is that they make mathematics come alive to a broad range of readers who might not look twice at a textbook or monograph. --Norman Biggs, London Mathematical Society Newsletter Deftly written and dynamic...The Fascinating World of Graph Theoryis an aptly named book, able to present a wide variety of central topics in graph theory, including the history behind them... in a lively and entertaining manner... A superb example of approachable mathematical writing. --SIAM Review The authors manage to motivate all topics with interesting applications, historical problems and discussion of concepts from an intuitive point of view. --Radu Trimbitas, Studia Mathematica I am not going to try to list the topics that are covered, since there is a great variety. This breadth, along with the superb writing, make the book a must-have for anyone with serious interest in graph theory. --James M. Cargal, UMAP Journal