Springer - Graph Theory: Favorite Conjectures And Open Problems - 1 (2016 EN)

Discussion in 'Others' started by Kanka, Oct 28, 2016.

  1. Kanka

    Kanka Well-Known Member Loyal User

    Messages:
    16,047
    Likes Received:
    449
    Trophy Points:
    83
    [​IMG]

    Author: Ralucca Gera (Editor), Stephen Hedetniemi (Editor), Craig Larson (Editor)
    Full Title: Graph Theory: Favorite Conjectures And Open Problems - 1
    Publisher: Springer; 1st ed. 2016 edition (November 20, 2016)
    Year: 2016
    ISBN-13: 9783319319407 (978-3-319-31940-7), 9783319319384 (978-3-319-31938-4)
    ISBN-10: 331931940X, 3319319388
    Pages: 291
    Language: English
    Genre: Mathematics
    File type: PDF (True)
    Quality: 10/10
    Price: 71.68 €


    This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors’ favorite conjectures and open problems, enhancing the reader’s overall comprehension and enthusiasm.

    The editors were inspired to create these volumes by the popular and well attended special sessions, entitled “My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In an effort to aid in the creation and dissemination of open problems, which is crucial to the growth and development of a field, the editors requested the speakers, as well as notable experts in graph theory, to contribute to these volumes.

    -------------
     
    Last edited by a moderator: Oct 20, 2019