東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph theory : = a problem oriented ...

Mathematical Association of America.

FindBook

Google Book

Amazon

博客來

Graph theory : = a problem oriented approach /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph theory :/ Daniel A. Marcus.
其他題名:	a problem oriented approach /
作者:	Marcus, Daniel A.,
出版者:	Washington, D.C. :Mathematical Association of America, : 2008,
面頁冊數:	xvi, 205 p. :ill.;26 cm.
附註:	Includes index.
內容註:	Introduction: Problems of graph theory -- A. Basic concepts -- B. Isomorphic graphs -- C. Bipartite graphs -- D. Trees and forests -- E. Spanning tree algorithms -- F. Euler paths -- G. Hamilton paths and cycles -- H. Planar graphs -- I. Independence and covering -- J. Connections and obstructions -- K. Vertex coloring -- L. Edge coloring -- M. Matching theory for bipartite graphs -- N. Applications of matching theory -- O. Cycle-free digraphs -- P. Network flow theory -- Q. Flow problems with lower bounds -- Answers to selected problems.
標題:	Graph theory. -
ISBN:	0883857537

Graph theory : = a problem oriented approach /
Marcus, Daniel A.,1945-

Graph theory :a problem oriented approach /Daniel A. Marcus. - Washington, D.C. :Mathematical Association of America,2008 - xvi, 205 p. :ill.;26 cm. - MAA textbooks. - MAA textbooks.

Includes index.

Introduction: Problems of graph theory -- A. Basic concepts -- B. Isomorphic graphs -- C. Bipartite graphs -- D. Trees and forests -- E. Spanning tree algorithms -- F. Euler paths -- G. Hamilton paths and cycles -- H. Planar graphs -- I. Independence and covering -- J. Connections and obstructions -- K. Vertex coloring -- L. Edge coloring -- M. Matching theory for bipartite graphs -- N. Applications of matching theory -- O. Cycle-free digraphs -- P. Network flow theory -- Q. Flow problems with lower bounds -- Answers to selected problems.

"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.

ISBN: 0883857537

LCCN: 2008922013Subjects--Topical Terms:

523815
Graph theory.

LC Class. No.: QA166 / .M37 2008

Dewey Class. No.: 511.5

Graph theory : = a problem oriented approach /
LDR:02798cam 2200277 a 450 001 872878
003 OCoLC
005 20100814153900.0
008 100814s2008 dcua 001 0 eng d
010 $a 2008922013
020 $a 0883857537
020 $a 9780883857533 : $c US56.99
029 1 $a AU@ $b 000043321020
029 1 $a CDX $b 7380390
035 $a 00512380
040 $a YDXCP $c YDXCP $d BTCTA $d JCU $d BAKER $d AKP $d MUU $d PUL $d AU@ $d CDX $d DLC $d OUP $d VP@ $d NDHU
049 $a FISA
050 0 0 $a QA166 $b .M37 2008
082 0 4 $a 511.5 $2 22
100 1 $a Marcus, Daniel A., $d 1945- $3 711349
245 0 0 $a Graph theory : $b a problem oriented approach / $c Daniel A. Marcus.
260 $a Washington, D.C. : $c 2008 $b Mathematical Association of America,
300 $a xvi, 205 p. : $b ill.; $c 26 cm.
490 1 $a MAA textbooks
500 $a Includes index.
505 0 $a Introduction: Problems of graph theory -- A. Basic concepts -- B. Isomorphic graphs -- C. Bipartite graphs -- D. Trees and forests -- E. Spanning tree algorithms -- F. Euler paths -- G. Hamilton paths and cycles -- H. Planar graphs -- I. Independence and covering -- J. Connections and obstructions -- K. Vertex coloring -- L. Edge coloring -- M. Matching theory for bipartite graphs -- N. Applications of matching theory -- O. Cycle-free digraphs -- P. Network flow theory -- Q. Flow problems with lower bounds -- Answers to selected problems.
520 $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 0 $a Graph theory. $3 523815
650 0 $a Graph theory $x Problems, exercises, etc. $3 714197
710 2 $a Mathematical Association of America. $3 514778
809 $p BOOK $d QA166 $e M37 $y 2008
830 0 $a MAA textbooks $3 1041611