The Fascinating World of Graph Theory / / Gary Chartrand, Arthur Benjamin, Ping Zhang.
Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathema...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2014-2015 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2015] ©2015 |
Year of Publication: | 2015 |
Edition: | Course Book |
Language: | English |
Online Access: | |
Physical Description: | 1 online resource (344 p.) :; 300 line illus. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
LEADER | 07619nam a22019215i 4500 | ||
---|---|---|---|
001 | 9781400852000 | ||
003 | DE-B1597 | ||
005 | 20210830012106.0 | ||
006 | m|||||o||d|||||||| | ||
007 | cr || |||||||| | ||
008 | 210830t20152015nju fo d z eng d | ||
020 | |a 9781400852000 | ||
024 | 7 | |a 10.1515/9781400852000 |2 doi | |
035 | |a (DE-B1597)459855 | ||
035 | |a (OCoLC)984656845 | ||
040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
041 | 0 | |a eng | |
044 | |a nju |c US-NJ | ||
050 | 4 | |a QA166 | |
072 | 7 | |a MAT013000 |2 bisacsh | |
082 | 0 | 4 | |a 511.5 |2 23 |
100 | 1 | |a Benjamin, Arthur, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
245 | 1 | 4 | |a The Fascinating World of Graph Theory / |c Gary Chartrand, Arthur Benjamin, Ping Zhang. |
250 | |a Course Book | ||
264 | 1 | |a Princeton, NJ : |b Princeton University Press, |c [2015] | |
264 | 4 | |c ©2015 | |
300 | |a 1 online resource (344 p.) : |b 300 line illus. | ||
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 | ||
505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Preface -- |t Prologue -- |t 1. Introducing Graphs -- |t 2. Classifying Graphs -- |t 3. Analyzing Distance -- |t 4. Constructing Trees -- |t 5. Traversing Graphs -- |t 6. Encircling Graphs -- |t 7. Factoring Graphs -- |t 8. Decomposing Graphs -- |t 9. Orienting Graphs -- |t 10. Drawing Graphs -- |t 11. Coloring Graphs -- |t 12. Synchronizing Graphs -- |t Epilogue. Graph Theory: A Look Back-The Road Ahead -- |t Exercises -- |t Selected References -- |t Index of Names -- |t Index of Mathematical Terms |
506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
520 | |a Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducing fundamental concepts, the authors explore a diverse plethora of classic problems such as the Lights Out Puzzle, and each chapter contains math exercises for readers to savor. An eye-opening journey into the world of graphs, The Fascinating World of Graph Theory offers exciting problem-solving possibilities for mathematics and beyond. | ||
530 | |a Issued also in print. | ||
538 | |a Mode of access: Internet via World Wide Web. | ||
546 | |a In English. | ||
588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) | |
650 | 0 | |a Graph theory. | |
650 | 7 | |a MATHEMATICS / Graphic Methods. |2 bisacsh | |
653 | |a 1-Factorization Conjecture. | ||
653 | |a 1-factorable graph. | ||
653 | |a 2-factorable graph. | ||
653 | |a Alfred Bray Kempe. | ||
653 | |a Alspach's Conjecture. | ||
653 | |a Around the World Problem. | ||
653 | |a Art Gallery Problem. | ||
653 | |a Arthur Cayley. | ||
653 | |a Brick-Factory Problem. | ||
653 | |a Cayley's Tree Formula. | ||
653 | |a Chinese Postman Problem. | ||
653 | |a Christian Goldbach. | ||
653 | |a Erdős number. | ||
653 | |a Euler Identity. | ||
653 | |a Euler Polyhedron Formula. | ||
653 | |a Eulerian graph. | ||
653 | |a First Theorem of Graph Theory. | ||
653 | |a Five Color Theorem. | ||
653 | |a Five Queens Problem. | ||
653 | |a Four Color Conjecture. | ||
653 | |a Four Color Problem. | ||
653 | |a Gottfried Leibniz. | ||
653 | |a Graceful Tree Conjecture. | ||
653 | |a Hall's Theorem. | ||
653 | |a Hamiltonian graph. | ||
653 | |a Herbert Ellis Robbins. | ||
653 | |a Icosian Game. | ||
653 | |a Instant Insanity. | ||
653 | |a Internet. | ||
653 | |a Job-Hunters Problem. | ||
653 | |a King Chicken Theorem. | ||
653 | |a Kirkman's Schoolgirl Problem. | ||
653 | |a Knight's Tour Puzzle. | ||
653 | |a Kruskal's Algorithm. | ||
653 | |a Kuratowski's Theorem. | ||
653 | |a Königsberg Bridge Problem. | ||
653 | |a Leonhard Euler. | ||
653 | |a Lights Out Puzzle. | ||
653 | |a Marriage Theorem. | ||
653 | |a Minimum Spanning Tree Problem. | ||
653 | |a Paul Erdős. | ||
653 | |a Peter Guthrie Tait. | ||
653 | |a Petersen graph. | ||
653 | |a Petersen's Theorem. | ||
653 | |a Pierre Fermat. | ||
653 | |a Polyhedron Problem. | ||
653 | |a Problem of the Five Princes. | ||
653 | |a Prüfer code. | ||
653 | |a Ramsey number. | ||
653 | |a Reconstruction Problem. | ||
653 | |a Road Coloring Theorem. | ||
653 | |a Robbins's Theorem. | ||
653 | |a Sir William Rowan Hamilton. | ||
653 | |a Steiner triple system. | ||
653 | |a Thomas Penyngton Kirkman. | ||
653 | |a Three Friends or Three Strangers Problem. | ||
653 | |a Three Houses and Three Utilities Problem. | ||
653 | |a Traveling Salesman Problem. | ||
653 | |a Traveller's Dodecahedron. | ||
653 | |a Tutte's Theorem. | ||
653 | |a Vizing's Theorem. | ||
653 | |a Voyage Round the World. | ||
653 | |a Wagner's Conjecture. | ||
653 | |a What Is Mathematics?. | ||
653 | |a William Tutte. | ||
653 | |a bipartite graph. | ||
653 | |a bridge. | ||
653 | |a chromatic index. | ||
653 | |a coloring. | ||
653 | |a complete graph. | ||
653 | |a complex numbers. | ||
653 | |a connected graph. | ||
653 | |a crossing number. | ||
653 | |a cyclic decomposition. | ||
653 | |a decision tree. | ||
653 | |a distance. | ||
653 | |a dominating set. | ||
653 | |a edge coloring. | ||
653 | |a geometry of position. | ||
653 | |a graceful graph. | ||
653 | |a graph theory. | ||
653 | |a graph. | ||
653 | |a icosian calculus. | ||
653 | |a irregular graph. | ||
653 | |a irregular multigraph. | ||
653 | |a isomorphic graph. | ||
653 | |a leaf. | ||
653 | |a mathematicians. | ||
653 | |a mathematics. | ||
653 | |a orientation. | ||
653 | |a oriented graph. | ||
653 | |a planar graph. | ||
653 | |a problem solving. | ||
653 | |a regular graph. | ||
653 | |a round robin tournament. | ||
653 | |a subgraph. | ||
653 | |a theorem. | ||
653 | |a tree. | ||
653 | |a vertex coloring. | ||
653 | |a voting. | ||
653 | |a weighted graph. | ||
700 | 1 | |a Chartrand, Gary, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
700 | 1 | |a Zhang, Ping, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton University Press Complete eBook-Package 2014-2015 |z 9783110665925 |
776 | 0 | |c print |z 9780691163819 | |
856 | 4 | 0 | |u https://doi.org/10.1515/9781400852000?locatt=mode:legacy |
856 | 4 | 0 | |u https://www.degruyter.com/isbn/9781400852000 |
856 | 4 | 2 | |3 Cover |u https://www.degruyter.com/cover/covers/9781400852000.jpg |
912 | |a 978-3-11-066592-5 Princeton University Press Complete eBook-Package 2014-2015 |c 2014 |d 2015 | ||
912 | |a EBA_BACKALL | ||
912 | |a EBA_CL_MTPY | ||
912 | |a EBA_EBACKALL | ||
912 | |a EBA_EBKALL | ||
912 | |a EBA_ECL_MTPY | ||
912 | |a EBA_EEBKALL | ||
912 | |a EBA_ESTMALL | ||
912 | |a EBA_PPALL | ||
912 | |a EBA_STMALL | ||
912 | |a GBV-deGruyter-alles | ||
912 | |a PDA12STME | ||
912 | |a PDA13ENGE | ||
912 | |a PDA18STMEE | ||
912 | |a PDA5EBK |