國立虎尾科技大學 |

Graph Theory = Favorite Conjectures and Open Problems - 1 /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Graph Theory/ edited by Ralucca Gera, Stephen Hedetniemi, Craig Larson.
Reminder of title:	Favorite Conjectures and Open Problems - 1 /
other author:	Gera, Ralucca.
Description:	XII, 291 p. 114 illus., 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Graph theory. -
Online resource:	https://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. - 1st ed. 2016. - XII, 291 p. 114 illus., 24 illus. in color.online resource. - 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) -- Chvátal'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:

527884
Graph theory.

LC Class. No.: QA166-166.247

Dewey Class. No.: 511.5

Graph Theory = Favorite Conjectures and Open Problems - 1 /
LDR:03593nam a22004095i 4500 001 979953
003 DE-He213
005 20200701172028.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319319407 $9 978-3-319-31940-7
024 7 $a 10.1007/978-3-319-31940-7 $2 doi
035 $a 978-3-319-31940-7
050 4 $a QA166-166.247
072 7 $a PBV $2 bicssc
072 7 $a MAT013000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.5 $2 23
245 1 0 $a Graph Theory $h [electronic resource] : $b Favorite Conjectures and Open Problems - 1 / $c edited by Ralucca Gera, Stephen Hedetniemi, Craig Larson.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XII, 291 p. 114 illus., 24 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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) -- Chvátal'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 527884
650 0 $a Combinatorics. $3 669353
650 0 $a Matrix theory. $3 1023862
650 0 $a Algebra. $2 gtt $3 579870
650 0 $a Mathematics. $3 527692
650 0 $a History. $3 669538
650 1 4 $a Graph Theory. $3 786670
650 2 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 672090
650 2 4 $a History of Mathematical Sciences. $3 785417
700 1 $a Gera, Ralucca. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1114866
700 1 $a Hedetniemi, Stephen. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1114867
700 1 $a Larson, Craig. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1114868
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319319384
776 0 8 $i Printed edition: $z 9783319319391
776 0 8 $i Printed edition: $z 9783319811598
830 0 $a Problem Books in Mathematics, $x 0941-3502 $3 1261008
856 4 0 $u https://doi.org/10.1007/978-3-319-31940-7
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)