Non-Fiction Books:

Graph Theory

Favorite Conjectures and Open Problems - 2

Format

Hardback

Customer rating

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Share this product

Graph Theory
Save $67.00
$101.99 was $168.99
or 4 payments of $25.50 with Learn more
Releases

Pre-order to reserve stock from our first shipment. Your credit card will not be charged until your order is ready to ship.

Available for pre-order now
Pre-order Price Guarantee

If you pre-order an item and the price drops before the release date, you’ll pay the lowest price. This happens automatically when you pre-order and pay by credit card.

If paying by PayPal or internet banking, and the price drops after you have paid, you can ask for the difference to be refunded. Find out more

If Mighty Ape's price changes before release, you'll pay the lowest price.

Availability

This product will be released on

Delivering to:

It should arrive:

  • 25-29 October using standard courier delivery

Description

This second volume in a two-volume series provides an extensive collection of conjectures and open problems in graph theory. It is designed for both graduate students and established researchers in discrete mathematics who are searching for research ideas and references. Each chapter provides more than a simple collection of results on a particular topic; it captures the reader's interest with techniques that worked and failed in attempting to solve particular conjectures. The history and origins of specific conjectures and the methods of researching them are also included throughout this volume. Students and researchers can discover how the conjectures have evolved and the various approaches that have been used in an attempt to solve them. An annotated glossary of nearly 300 graph theory parameters, 70 conjectures, and over 600 references is also included in this volume. This glossary provides an understanding of parameters beyond their definitions and enables readers to discover new ideas and new definitions in graph theory. The editors were inspired to create this series of volumes by the popular and well-attended special sessions entitled "My Favorite Graph Theory Conjectures," which they organized at past AMS meetings. These sessions were held at the winter AMS/MAA Joint Meeting in Boston, January 2012, the SIAM Conference on Discrete Mathematics in Halifax in June 2012, as well as the winter AMS/MAA Joint Meeting in Baltimore in January 2014, at which many of the best-known graph theorists spoke. In an effort to aid in the creation and dissemination of conjectures and open problems, which is crucial to the growth and development of this field, the editors invited these speakers, as well as other experts in graph theory, to contribute to this series.

Author Biography

Ralucca Gera is the Associate Provost for Graduate Education and Professor of Mathematics in the Applied Math Department at the Naval Postgraduate School. She is also a researcher in the Center for Cyber Warfare at the Naval Postgraduate School and the Network Science Center at United States Military Academy. Her research interests include graph theory, network science, machine learning and artificial intelligence.Stephen T. Hedetniemi is a Professor Emeritus in the School of Computing at Clemson University. His research interests include graph theory, graph algorithms, and computational complexity. Teresa W. Haynes is a Professor of Mathematics at East Tennessee State University and a Visiting Professor at the University of Johannesburg, South Africa. Her research interest is graph theory.
Release date Australia
October 21st, 2018
Contributors
Edited by Ralucca Gera Edited by Stephen Hedetniemi Edited by Teresa W. Haynes
Country of Publication
Switzerland
Edition
1st ed. 2018
Illustrations
50 Tables, color; 15 Illustrations, color; 36 Illustrations, black and white; X, 284 p. 51 illus., 15 illus. in color.
Imprint
Springer International Publishing AG
Pages
281
ISBN-13
9783319976846
Product ID
28248934

Customer previews

Nobody has previewed this product yet. You could be the first!

Write a Preview

Help & options

  • If you think we've made a mistake or omitted details, please send us your feedback. Send Feedback
  • If you have a question or problem with this product, visit our Help section. Get Help
  • Seen a lower price for this product elsewhere? We'll do our best to beat it. Request a better price
Filed under...