Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Graph theory : a problem oriented approach, Daniel A. Marcus
Graph theory : a problem oriented approach, Daniel A. Marcus
Resource Information
The item Graph theory : a problem oriented approach, Daniel A. Marcus represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Graph theory : a problem oriented approach, Daniel A. Marcus represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 "Graph Theory presents a natural, readerfriendly 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 problemoriented 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 KonigEgervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."Back cover
 Language
 eng
 Extent
 xvi, 205 p.
 Note
 Includes index
 Contents

 Introduction: Problems of graph theory
 Basic concepts
 Isomorphic graphs
 Bipartite graphs
 Trees and forests
 Spanning tree algorithms
 Euler paths
 Hamilton paths and cycles
 Planar graphs
 Independence and covering
 Connections and obstructions
 Vertex coloring
 Edge coloring
 Matching theory for bipartite graphs
 Applications of matching theory
 Cyclefree digraphs
 Network flow theory
 Flow problems with lower bounds
 Answers to selected problems
 Isbn
 9780883857533
 Label
 Graph theory : a problem oriented approach
 Title
 Graph theory
 Title remainder
 a problem oriented approach
 Statement of responsibility
 Daniel A. Marcus
 Language
 eng
 Summary
 "Graph Theory presents a natural, readerfriendly 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 problemoriented 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 KonigEgervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."Back cover
 Additional physical form
 Table of contents, contributor biographical information, and publisher description available via the World Wide Web.
 Cataloging source
 YDXCP
 http://library.link/vocab/creatorDate
 1945
 http://library.link/vocab/creatorName
 Marcus, Daniel A.
 Index
 no index present
 LC call number
 QA166
 LC item number
 .M345 2008
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName
 Mathematical Association of America
 Series statement
 MAA textbooks
 http://library.link/vocab/subjectName

 Graph theory
 Graph theory
 Label
 Graph theory : a problem oriented approach, Daniel A. Marcus
 Link
 Note
 Includes index
 Contents
 Introduction: Problems of graph theory  Basic concepts  Isomorphic graphs  Bipartite graphs  Trees and forests  Spanning tree algorithms  Euler paths  Hamilton paths and cycles  Planar graphs  Independence and covering  Connections and obstructions  Vertex coloring  Edge coloring  Matching theory for bipartite graphs  Applications of matching theory  Cyclefree digraphs  Network flow theory  Flow problems with lower bounds  Answers to selected problems
 Dimensions
 27 cm.
 Extent
 xvi, 205 p.
 Isbn
 9780883857533
 Lccn
 2008922013
 Other physical details
 ill.
 System control number

 323516001okla_normanlaw
 (SIRSI)3235160
 (Sirsi) o191856279
 (OCoLC)191856279
 Label
 Graph theory : a problem oriented approach, Daniel A. Marcus
 Link
 Note
 Includes index
 Contents
 Introduction: Problems of graph theory  Basic concepts  Isomorphic graphs  Bipartite graphs  Trees and forests  Spanning tree algorithms  Euler paths  Hamilton paths and cycles  Planar graphs  Independence and covering  Connections and obstructions  Vertex coloring  Edge coloring  Matching theory for bipartite graphs  Applications of matching theory  Cyclefree digraphs  Network flow theory  Flow problems with lower bounds  Answers to selected problems
 Dimensions
 27 cm.
 Extent
 xvi, 205 p.
 Isbn
 9780883857533
 Lccn
 2008922013
 Other physical details
 ill.
 System control number

 323516001okla_normanlaw
 (SIRSI)3235160
 (Sirsi) o191856279
 (OCoLC)191856279
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/Graphtheoryaproblemorientedapproach/AXJk1dkn7c/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/Graphtheoryaproblemorientedapproach/AXJk1dkn7c/">Graph theory : a problem oriented approach, Daniel A. Marcus</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Graph theory : a problem oriented approach, Daniel A. Marcus
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/Graphtheoryaproblemorientedapproach/AXJk1dkn7c/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/Graphtheoryaproblemorientedapproach/AXJk1dkn7c/">Graph theory : a problem oriented approach, Daniel A. Marcus</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>