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!
|
| id |
9781400852000 |
|---|---|
| ctrlnum |
(DE-B1597)459855 (OCoLC)984656845 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Benjamin, Arthur, author. aut http://id.loc.gov/vocabulary/relators/aut The Fascinating World of Graph Theory / Gary Chartrand, Arthur Benjamin, Ping Zhang. Course Book Princeton, NJ : Princeton University Press, [2015] ©2015 1 online resource (344 p.) : 300 line illus. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Frontmatter -- Contents -- Preface -- Prologue -- 1. Introducing Graphs -- 2. Classifying Graphs -- 3. Analyzing Distance -- 4. Constructing Trees -- 5. Traversing Graphs -- 6. Encircling Graphs -- 7. Factoring Graphs -- 8. Decomposing Graphs -- 9. Orienting Graphs -- 10. Drawing Graphs -- 11. Coloring Graphs -- 12. Synchronizing Graphs -- Epilogue. Graph Theory: A Look Back-The Road Ahead -- Exercises -- Selected References -- Index of Names -- Index of Mathematical Terms restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) Graph theory. MATHEMATICS / Graphic Methods. bisacsh 1-Factorization Conjecture. 1-factorable graph. 2-factorable graph. Alfred Bray Kempe. Alspach's Conjecture. Around the World Problem. Art Gallery Problem. Arthur Cayley. Brick-Factory Problem. Cayley's Tree Formula. Chinese Postman Problem. Christian Goldbach. Erdős number. Euler Identity. Euler Polyhedron Formula. Eulerian graph. First Theorem of Graph Theory. Five Color Theorem. Five Queens Problem. Four Color Conjecture. Four Color Problem. Gottfried Leibniz. Graceful Tree Conjecture. Hall's Theorem. Hamiltonian graph. Herbert Ellis Robbins. Icosian Game. Instant Insanity. Internet. Job-Hunters Problem. King Chicken Theorem. Kirkman's Schoolgirl Problem. Knight's Tour Puzzle. Kruskal's Algorithm. Kuratowski's Theorem. Königsberg Bridge Problem. Leonhard Euler. Lights Out Puzzle. Marriage Theorem. Minimum Spanning Tree Problem. Paul Erdős. Peter Guthrie Tait. Petersen graph. Petersen's Theorem. Pierre Fermat. Polyhedron Problem. Problem of the Five Princes. Prüfer code. Ramsey number. Reconstruction Problem. Road Coloring Theorem. Robbins's Theorem. Sir William Rowan Hamilton. Steiner triple system. Thomas Penyngton Kirkman. Three Friends or Three Strangers Problem. Three Houses and Three Utilities Problem. Traveling Salesman Problem. Traveller's Dodecahedron. Tutte's Theorem. Vizing's Theorem. Voyage Round the World. Wagner's Conjecture. What Is Mathematics?. William Tutte. bipartite graph. bridge. chromatic index. coloring. complete graph. complex numbers. connected graph. crossing number. cyclic decomposition. decision tree. distance. dominating set. edge coloring. geometry of position. graceful graph. graph theory. graph. icosian calculus. irregular graph. irregular multigraph. isomorphic graph. leaf. mathematicians. mathematics. orientation. oriented graph. planar graph. problem solving. regular graph. round robin tournament. subgraph. theorem. tree. vertex coloring. voting. weighted graph. Chartrand, Gary, author. aut http://id.loc.gov/vocabulary/relators/aut Zhang, Ping, author. aut http://id.loc.gov/vocabulary/relators/aut Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2014-2015 9783110665925 print 9780691163819 https://doi.org/10.1515/9781400852000?locatt=mode:legacy https://www.degruyter.com/isbn/9781400852000 Cover https://www.degruyter.com/cover/covers/9781400852000.jpg |
| language |
English |
| format |
eBook |
| author |
Benjamin, Arthur, Benjamin, Arthur, Chartrand, Gary, Zhang, Ping, |
| spellingShingle |
Benjamin, Arthur, Benjamin, Arthur, Chartrand, Gary, Zhang, Ping, The Fascinating World of Graph Theory / Frontmatter -- Contents -- Preface -- Prologue -- 1. Introducing Graphs -- 2. Classifying Graphs -- 3. Analyzing Distance -- 4. Constructing Trees -- 5. Traversing Graphs -- 6. Encircling Graphs -- 7. Factoring Graphs -- 8. Decomposing Graphs -- 9. Orienting Graphs -- 10. Drawing Graphs -- 11. Coloring Graphs -- 12. Synchronizing Graphs -- Epilogue. Graph Theory: A Look Back-The Road Ahead -- Exercises -- Selected References -- Index of Names -- Index of Mathematical Terms |
| author_facet |
Benjamin, Arthur, Benjamin, Arthur, Chartrand, Gary, Zhang, Ping, Chartrand, Gary, Chartrand, Gary, Zhang, Ping, Zhang, Ping, |
| author_variant |
a b ab a b ab g c gc p z pz |
| author_role |
VerfasserIn VerfasserIn VerfasserIn VerfasserIn |
| author2 |
Chartrand, Gary, Chartrand, Gary, Zhang, Ping, Zhang, Ping, |
| author2_variant |
g c gc p z pz |
| author2_role |
VerfasserIn VerfasserIn VerfasserIn VerfasserIn |
| author_sort |
Benjamin, Arthur, |
| title |
The Fascinating World of Graph Theory / |
| title_full |
The Fascinating World of Graph Theory / Gary Chartrand, Arthur Benjamin, Ping Zhang. |
| title_fullStr |
The Fascinating World of Graph Theory / Gary Chartrand, Arthur Benjamin, Ping Zhang. |
| title_full_unstemmed |
The Fascinating World of Graph Theory / Gary Chartrand, Arthur Benjamin, Ping Zhang. |
| title_auth |
The Fascinating World of Graph Theory / |
| title_alt |
Frontmatter -- Contents -- Preface -- Prologue -- 1. Introducing Graphs -- 2. Classifying Graphs -- 3. Analyzing Distance -- 4. Constructing Trees -- 5. Traversing Graphs -- 6. Encircling Graphs -- 7. Factoring Graphs -- 8. Decomposing Graphs -- 9. Orienting Graphs -- 10. Drawing Graphs -- 11. Coloring Graphs -- 12. Synchronizing Graphs -- Epilogue. Graph Theory: A Look Back-The Road Ahead -- Exercises -- Selected References -- Index of Names -- Index of Mathematical Terms |
| title_new |
The Fascinating World of Graph Theory / |
| title_sort |
the fascinating world of graph theory / |
| publisher |
Princeton University Press, |
| publishDate |
2015 |
| physical |
1 online resource (344 p.) : 300 line illus. Issued also in print. |
| edition |
Course Book |
| contents |
Frontmatter -- Contents -- Preface -- Prologue -- 1. Introducing Graphs -- 2. Classifying Graphs -- 3. Analyzing Distance -- 4. Constructing Trees -- 5. Traversing Graphs -- 6. Encircling Graphs -- 7. Factoring Graphs -- 8. Decomposing Graphs -- 9. Orienting Graphs -- 10. Drawing Graphs -- 11. Coloring Graphs -- 12. Synchronizing Graphs -- Epilogue. Graph Theory: A Look Back-The Road Ahead -- Exercises -- Selected References -- Index of Names -- Index of Mathematical Terms |
| isbn |
9781400852000 9783110665925 9780691163819 |
| callnumber-first |
Q - Science |
| callnumber-subject |
QA - Mathematics |
| callnumber-label |
QA166 |
| callnumber-sort |
QA 3166 |
| url |
https://doi.org/10.1515/9781400852000?locatt=mode:legacy https://www.degruyter.com/isbn/9781400852000 https://www.degruyter.com/cover/covers/9781400852000.jpg |
| illustrated |
Illustrated |
| dewey-hundreds |
500 - Science |
| dewey-tens |
510 - Mathematics |
| dewey-ones |
511 - General principles of mathematics |
| dewey-full |
511.5 |
| dewey-sort |
3511.5 |
| dewey-raw |
511.5 |
| dewey-search |
511.5 |
| doi_str_mv |
10.1515/9781400852000?locatt=mode:legacy |
| oclc_num |
984656845 |
| work_keys_str_mv |
AT benjaminarthur thefascinatingworldofgraphtheory AT chartrandgary thefascinatingworldofgraphtheory AT zhangping thefascinatingworldofgraphtheory AT benjaminarthur fascinatingworldofgraphtheory AT chartrandgary fascinatingworldofgraphtheory AT zhangping fascinatingworldofgraphtheory |
| status_str |
n |
| ids_txt_mv |
(DE-B1597)459855 (OCoLC)984656845 |
| carrierType_str_mv |
cr |
| hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2014-2015 |
| is_hierarchy_title |
The Fascinating World of Graph Theory / |
| container_title |
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2014-2015 |
| author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField noLinkedField |
| _version_ |
1806143583317655552 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>07619nam a22019215i 4500</leader><controlfield tag="001">9781400852000</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20152015nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400852000</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400852000</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)459855</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)984656845</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Benjamin, Arthur, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The Fascinating World of Graph Theory /</subfield><subfield code="c">Gary Chartrand, Arthur Benjamin, Ping Zhang.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (344 p.) :</subfield><subfield code="b">300 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Prologue -- </subfield><subfield code="t">1. Introducing Graphs -- </subfield><subfield code="t">2. Classifying Graphs -- </subfield><subfield code="t">3. Analyzing Distance -- </subfield><subfield code="t">4. Constructing Trees -- </subfield><subfield code="t">5. Traversing Graphs -- </subfield><subfield code="t">6. Encircling Graphs -- </subfield><subfield code="t">7. Factoring Graphs -- </subfield><subfield code="t">8. Decomposing Graphs -- </subfield><subfield code="t">9. Orienting Graphs -- </subfield><subfield code="t">10. Drawing Graphs -- </subfield><subfield code="t">11. Coloring Graphs -- </subfield><subfield code="t">12. Synchronizing Graphs -- </subfield><subfield code="t">Epilogue. Graph Theory: A Look Back-The Road Ahead -- </subfield><subfield code="t">Exercises -- </subfield><subfield code="t">Selected References -- </subfield><subfield code="t">Index of Names -- </subfield><subfield code="t">Index of Mathematical Terms</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Graphic Methods.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">1-Factorization Conjecture.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">1-factorable graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">2-factorable graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Alfred Bray Kempe.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Alspach's Conjecture.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Around the World Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Art Gallery Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Arthur Cayley.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Brick-Factory Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cayley's Tree Formula.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chinese Postman Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Christian Goldbach.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Erdős number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Euler Identity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Euler Polyhedron Formula.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Eulerian graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">First Theorem of Graph Theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Five Color Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Five Queens Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Four Color Conjecture.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Four Color Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gottfried Leibniz.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graceful Tree Conjecture.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hall's Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hamiltonian graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Herbert Ellis Robbins.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Icosian Game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Instant Insanity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Internet.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Job-Hunters Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">King Chicken Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kirkman's Schoolgirl Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Knight's Tour Puzzle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kruskal's Algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kuratowski's Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Königsberg Bridge Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Leonhard Euler.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lights Out Puzzle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Marriage Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Minimum Spanning Tree Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Paul Erdős.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Peter Guthrie Tait.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Petersen graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Petersen's Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Pierre Fermat.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Polyhedron Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Problem of the Five Princes.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Prüfer code.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ramsey number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Reconstruction Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Road Coloring Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robbins's Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sir William Rowan Hamilton.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Steiner triple system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Thomas Penyngton Kirkman.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Three Friends or Three Strangers Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Three Houses and Three Utilities Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Traveling Salesman Problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Traveller's Dodecahedron.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Tutte's Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Vizing's Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Voyage Round the World.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Wagner's Conjecture.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">What Is Mathematics?.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">William Tutte.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bipartite graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bridge.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">chromatic index.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">coloring.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">complete graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">complex numbers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">connected graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">crossing number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">cyclic decomposition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">decision tree.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">distance.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dominating set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">edge coloring.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">geometry of position.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graceful graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">icosian calculus.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">irregular graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">irregular multigraph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">isomorphic graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">leaf.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mathematicians.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">orientation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">oriented graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">planar graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">problem solving.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">regular graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">round robin tournament.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">subgraph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">tree.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">vertex coloring.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">voting.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">weighted graph.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chartrand, Gary, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Ping, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press Complete eBook-Package 2014-2015</subfield><subfield code="z">9783110665925</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691163819</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400852000?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400852000</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400852000.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-066592-5 Princeton University Press Complete eBook-Package 2014-2015</subfield><subfield code="c">2014</subfield><subfield code="d">2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |