<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>02812nam a2200373 a 4500</leader>
  <controlfield tag="001">ebr10733067</controlfield>
  <controlfield tag="003">CaPaEBR</controlfield>
  <controlfield tag="006">m     o  u        </controlfield>
  <controlfield tag="007">cr cn|||||||||</controlfield>
  <controlfield tag="008">080130s2008    dcua    s     001 0 eng d</controlfield>
  <datafield tag="010" ind1=" " ind2=" ">
    <subfield code="z">  2008922013</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="z">0883857537</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="z">9780883857533</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="z">9780883857755</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="z">9780883859698 (e-book)</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">CaPaEBR</subfield>
    <subfield code="c">CaPaEBR</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(OCoLC)857078197</subfield>
  </datafield>
  <datafield tag="050" ind1="1" ind2="4">
    <subfield code="a">QA166</subfield>
    <subfield code="b">.M37 2008eb</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="4">
    <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>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Graph theory</subfield>
    <subfield code="h">[electronic resource] :</subfield>
    <subfield code="b">a problem oriented approach /</subfield>
    <subfield code="c">Daniel A. Marcus.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <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>
    <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="440" ind1=" " ind2="0">
    <subfield code="a">MAA textbooks</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Includes index.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " 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="533" ind1=" " ind2=" ">
    <subfield code="a">Electronic reproduction.</subfield>
    <subfield code="b">Palo Alto, Calif. :</subfield>
    <subfield code="c">ebrary,</subfield>
    <subfield code="d">2013.</subfield>
    <subfield code="n">Available via World Wide Web.</subfield>
    <subfield code="n">Access may be limited to ebrary affiliated libraries.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Graph theory.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Graph theory</subfield>
    <subfield code="v">Problems, exercises, etc.</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="7">
    <subfield code="a">Electronic books.</subfield>
    <subfield code="2">local</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">Mathematical Association of America.</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">ebrary, Inc.</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">http://site.ebrary.com/lib/rucke/Doc?id=10733067</subfield>
    <subfield code="z">An electronic book accessible through the World Wide Web; click to view</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">36716</subfield>
    <subfield code="d">36716</subfield>
  </datafield>
</record>
