東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph theory = favorite conjectures ...

Gera, Ralucca.

FindBook

Google Book

Amazon

博客來

Graph theory = favorite conjectures and open problems - 1 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graph theory/ edited by Ralucca Gera, Stephen Hedetniemi, Craig Larson.
其他題名:	favorite conjectures and open problems - 1 /
其他作者:	Gera, Ralucca.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	xii, 291 p. :ill. (some col.), digital ;24 cm.
內容註:	Highly Irregular (G. Chartrand) -- Hamiltonian Extension (P. Zhang) -- On Some Open Questions for Ramsey and Folkman Numbers (S. Radziszowski and X. Xu) -- All my favorite conjectures are critical(T. Haynes) -- The local representation of graph conjecture(E. Scheinerman) -- Some of My Favorite Coloring Problems for Graphs and Digraphs (J. Gimble) -- My Top 10 Favorite Conjectures and Open Problems(S. Hedetniemi) -- Chvatal's t0-tough conjecture (L. Lesniak) -- What do Trees and Hypercubes have in Common (H. Mulder) -- Two chromatic conjectures: one for vertices, one for edges (M. Kayll) -- Some Conjectures and Questions in Chromatic Topological Graph Theory (J. Hutchinson) -- Turan's Brick factory problem (L. Szekely) -It is all labeling (P. Slater) -- My Favorite Domination Conjectures (M. Henning) -- Circuit Double Covers of Graphs (C. Zhang)
Contained By:	Springer eBooks
標題:	Graph theory. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-31940-7
ISBN:	9783319319407

Graph theory = favorite conjectures and open problems - 1 /
Graph theoryfavorite conjectures and open problems - 1 /[electronic resource] :edited by Ralucca Gera, Stephen Hedetniemi, Craig Larson. - Cham :Springer International Publishing :2016. - xii, 291 p. :ill. (some col.), digital ;24 cm. - Problem books in mathematics,0941-3502. - Problem books in mathematics..

Highly Irregular (G. Chartrand) -- Hamiltonian Extension (P. Zhang) -- On Some Open Questions for Ramsey and Folkman Numbers (S. Radziszowski and X. Xu) -- All my favorite conjectures are critical(T. Haynes) -- The local representation of graph conjecture(E. Scheinerman) -- Some of My Favorite Coloring Problems for Graphs and Digraphs (J. Gimble) -- My Top 10 Favorite Conjectures and Open Problems(S. Hedetniemi) -- Chvatal's t0-tough conjecture (L. Lesniak) -- What do Trees and Hypercubes have in Common (H. Mulder) -- Two chromatic conjectures: one for vertices, one for edges (M. Kayll) -- Some Conjectures and Questions in Chromatic Topological Graph Theory (J. Hutchinson) -- Turan's Brick factory problem (L. Szekely) -It is all labeling (P. Slater) -- My Favorite Domination Conjectures (M. Henning) -- Circuit Double Covers of Graphs (C. Zhang)

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.

ISBN: 9783319319407

Standard No.: 10.1007/978-3-319-31940-7doiSubjects--Topical Terms:

523815
Graph theory.

LC Class. No.: QA166

Dewey Class. No.: 511.5

Graph theory = favorite conjectures and open problems - 1 /
LDR:03155nmm a2200325 a 4500 001 2053767
003 DE-He213
005 20161019092501.0
006 m d
007 cr nn 008maaau
008 170510s2016 gw s 0 eng d
020 $a 9783319319407 $q (electronic bk.)
020 $a 9783319319384 $q (paper)
024 7 $a 10.1007/978-3-319-31940-7 $2 doi
035 $a 978-3-319-31940-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
072 7 $a PBV $2 bicssc
072 7 $a MAT013000 $2 bisacsh
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .G766 2016
245 0 0 $a Graph theory $h [electronic resource] : $b favorite conjectures and open problems - 1 / $c edited by Ralucca Gera, Stephen Hedetniemi, Craig Larson.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xii, 291 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Problem books in mathematics, $x 0941-3502
505 0 $a Highly Irregular (G. Chartrand) -- Hamiltonian Extension (P. Zhang) -- On Some Open Questions for Ramsey and Folkman Numbers (S. Radziszowski and X. Xu) -- All my favorite conjectures are critical(T. Haynes) -- The local representation of graph conjecture(E. Scheinerman) -- Some of My Favorite Coloring Problems for Graphs and Digraphs (J. Gimble) -- My Top 10 Favorite Conjectures and Open Problems(S. Hedetniemi) -- Chvatal's t0-tough conjecture (L. Lesniak) -- What do Trees and Hypercubes have in Common (H. Mulder) -- Two chromatic conjectures: one for vertices, one for edges (M. Kayll) -- Some Conjectures and Questions in Chromatic Topological Graph Theory (J. Hutchinson) -- Turan's Brick factory problem (L. Szekely) -It is all labeling (P. Slater) -- My Favorite Domination Conjectures (M. Henning) -- Circuit Double Covers of Graphs (C. Zhang)
520 $a 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.
650 0 $a Graph theory. $3 523815
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 891082
650 2 4 $a History of Mathematical Sciences. $3 1530523
700 1 $a Gera, Ralucca. $3 3166879
700 1 $a Hedetniemi, Stephen. $3 3166880
700 1 $a Larson, Craig. $3 3166881
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Problem books in mathematics. $3 1535952
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-31940-7
950 $a Mathematics and Statistics (Springer-11649)