Graph Theory Favorite Conjectures and Open Problems - 2 /
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 t...
Uloženo v:
| Médium: | Elektronický zdroj E-kniha |
|---|---|
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer International Publishing,
2018.
|
| Vydání: | 1st ed. 2018. |
| Edice: | Problem Books in Mathematics,
|
| Témata: | |
| ISBN: | 9783319976860 |
| ISSN: | 0941-3502 |
| On-line přístup: |
|
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 003 | SK-BrCVT | ||
| 005 | 20220618121052.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 181026s2018 gw | s |||| 0|eng d | ||
| 020 | |a 9783319976860 | ||
| 024 | 7 | |a 10.1007/978-3-319-97686-0 |2 doi | |
| 035 | |a CVTIDW09837 | ||
| 040 | |a Springer-Nature |b eng |c CVTISR |e AACR2 | ||
| 041 | |a eng | ||
| 245 | 1 | 0 | |a Graph Theory |h [electronic resource] : |b Favorite Conjectures and Open Problems - 2 / |c edited by Ralucca Gera, Teresa W. Haynes, Stephen T. Hedetniemi. |
| 250 | |a 1st ed. 2018. | ||
| 260 | 1 | |a Cham : |b Springer International Publishing, |c 2018. | |
| 300 | |a VI, 281 p. 51 illus., 15 illus. in color. |b online resource. | ||
| 490 | 1 | |a Problem Books in Mathematics, |x 0941-3502 | |
| 500 | |a Mathematics and Statistics | ||
| 505 | 0 | |a 1. Desert Island Conjectures (L.W. Beineke) -- 2. Binding Number, Cycles and Cliques ( W. Goddard) -- 3. On a Conjecture Involving Laplacian Eigenvalues of Trees (D. P. Jacobs and V. Trevison) -- 4. Queens Around the World in Twenty-five Years ( D. Weakley) -- 5. Reflections on a Theme of Ulam (R.Graham) -- 6. Ulam Numbers of Graphs (S.T. Hedetniemi) -- 7. Forbidden Trees (D. Sumner) -- 8. Some of My Favorite Conjectures: Local Conditions Implying Global Cycle Properties (O. Oellermann) -- 9. The Path Partition Conjecture (M. Frick and J. E. Dunbar) -- 10. To the Moon and Beyond (E. Gethner) -- 11. My Favorite Domination Game Conjectures (M. A. Henning) -- 12. A De Bruijn-Erdos theorem in graphs? (V. Chvatal) -- 13. An Annotated Glossary of Graph Theory Parameters, with Conjectures (R. Gera, T. W. Haynes, S. T. Hedetniemi, and M. A. Henning). | |
| 516 | |a text file PDF | ||
| 520 | |a 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. | ||
| 650 | 0 | |a Graph theory. | |
| 650 | 0 | |a Combinatorics. | |
| 650 | 0 | |a Matrix theory. | |
| 650 | 0 | |a Algebra. | |
| 650 | 0 | |a Mathematics. | |
| 650 | 0 | |a History. | |
| 856 | 4 | 0 | |u http://hanproxy.cvtisr.sk/han/cvti-ebook-springer-eisbn-978-3-319-97686-0 |y Vzdialený prístup pre registrovaných používateľov |
| 910 | |b ZE07117 | ||
| 919 | |a 978-3-319-97686-0 | ||
| 974 | |a andrea.lebedova |f Elektronické zdroje | ||
| 992 | |a SUD | ||
| 999 | |c 276220 |d 276220 | ||