Graph theory: a problem oriented approach
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Washington, D.C.
Mathematical Association of America
c2008
|
| Schlagworte: | |
| Beschreibung: | Includes index |
| Beschreibung: | xvi, 205 p. |
| ISBN: | 0883857537 9780883857533 9780883857755 9780883859698 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044852222 | ||
| 003 | DE-604 | ||
| 005 | 20180305 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180305s2008 |||| o||u| ||||||eng d | ||
| 020 | |a 0883857537 |9 0-88385-753-7 | ||
| 020 | |a 9780883857533 |9 978-0-88385-753-3 | ||
| 020 | |a 9780883857755 |9 978-0-88385-775-5 | ||
| 020 | |a 9780883859698 |c Online |9 978-0-88385-969-8 | ||
| 035 | |a (ZDB-38-ESG)ebr10733067 | ||
| 035 | |a (OCoLC)857078197 | ||
| 035 | |a (DE-599)BVBBV044852222 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 511.5 |2 22 | |
| 100 | 1 | |a Marcus, Daniel A. |d 1945- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph theory |b a problem oriented approach |c Daniel A. Marcus |
| 264 | 1 | |a Washington, D.C. |b Mathematical Association of America |c c2008 | |
| 300 | |a xvi, 205 p. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes index | ||
| 505 | 8 | |a "Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Graph theory |v Problems, exercises, etc | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 710 | 2 | |a Mathematical Association of America |e Sonstige |4 oth | |
| 912 | |a ZDB-38-ESG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030247082 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804178369336573952 |
|---|---|
| any_adam_object | |
| author | Marcus, Daniel A. 1945- |
| author_facet | Marcus, Daniel A. 1945- |
| author_role | aut |
| author_sort | Marcus, Daniel A. 1945- |
| author_variant | d a m da dam |
| building | Verbundindex |
| bvnumber | BV044852222 |
| collection | ZDB-38-ESG |
| contents | "Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover |
| ctrlnum | (ZDB-38-ESG)ebr10733067 (OCoLC)857078197 (DE-599)BVBBV044852222 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02873nmm a2200421zc 4500</leader><controlfield tag="001">BV044852222</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180305 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180305s2008 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0883857537</subfield><subfield code="9">0-88385-753-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780883857533</subfield><subfield code="9">978-0-88385-753-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780883857755</subfield><subfield code="9">978-0-88385-775-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780883859698</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-88385-969-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-ESG)ebr10733067</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)857078197</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044852222</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Marcus, Daniel A.</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theory</subfield><subfield code="b">a problem oriented approach</subfield><subfield code="c">Daniel A. Marcus</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Washington, D.C.</subfield><subfield code="b">Mathematical Association of America</subfield><subfield code="c">c2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xvi, 205 p.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">"Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="v">Problems, exercises, etc</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Mathematical Association of America</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-38-ESG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030247082</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV044852222 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:02:53Z |
| institution | BVB |
| isbn | 0883857537 9780883857533 9780883857755 9780883859698 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030247082 |
| oclc_num | 857078197 |
| open_access_boolean | |
| physical | xvi, 205 p. |
| psigel | ZDB-38-ESG |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Mathematical Association of America |
| record_format | marc |
| spelling | Marcus, Daniel A. 1945- Verfasser aut Graph theory a problem oriented approach Daniel A. Marcus Washington, D.C. Mathematical Association of America c2008 xvi, 205 p. txt rdacontent c rdamedia cr rdacarrier Includes index "Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover Graph theory Graph theory Problems, exercises, etc Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s 1\p DE-604 Mathematical Association of America Sonstige oth 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Marcus, Daniel A. 1945- Graph theory a problem oriented approach "Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover Graph theory Graph theory Problems, exercises, etc Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4113782-6 |
| title | Graph theory a problem oriented approach |
| title_auth | Graph theory a problem oriented approach |
| title_exact_search | Graph theory a problem oriented approach |
| title_full | Graph theory a problem oriented approach Daniel A. Marcus |
| title_fullStr | Graph theory a problem oriented approach Daniel A. Marcus |
| title_full_unstemmed | Graph theory a problem oriented approach Daniel A. Marcus |
| title_short | Graph theory |
| title_sort | graph theory a problem oriented approach |
| title_sub | a problem oriented approach |
| topic | Graph theory Graph theory Problems, exercises, etc Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Graph theory Graph theory Problems, exercises, etc Graphentheorie |
| work_keys_str_mv | AT marcusdaniela graphtheoryaproblemorientedapproach AT mathematicalassociationofamerica graphtheoryaproblemorientedapproach |