東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Bipartite graphs and their applications

Asratian, Armen S., (1957-)

Linked to FindBook

Google Book

Amazon

博客來

Bipartite graphs and their applications

Record Type:	Electronic resources : Monograph/item
Title/Author:	Bipartite graphs and their applications/ Armen S. Asratian, Tristan M.J. Denley, Roland Haggkvist.
remainder title:	Bipartite Graphs & their Applications
Author:	Asratian, Armen S.,
other author:	Denley, Tristan M. J.,
Published:	Cambridge :Cambridge University Press, : 1998.,
Description:	xi, 259 p. :ill., digital ;24 cm.
Notes:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Subject:	Bipartite graphs. -
Online resource:	https://doi.org/10.1017/CBO9780511984068
ISBN:	9780511984068

Bipartite graphs and their applications
Asratian, Armen S.,1957-

Bipartite graphs and their applications[electronic resource] /Bipartite Graphs & their ApplicationsArmen S. Asratian, Tristan M.J. Denley, Roland Haggkvist. - Cambridge :Cambridge University Press,1998. - xi, 259 p. :ill., digital ;24 cm. - Cambridge tracts in mathematics ;131. - Cambridge tracts in mathematics ;131..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. However, sometimes they have been considered only as a special class in some wider context. This book deals solely with bipartite graphs. Together with traditional material, the reader will also find many unusual results. Essentially all proofs are given in full; many of these have been streamlined specifically for this text. Numerous exercises of all standards have also been included. The theory is illustrated with many applications especially to problems in timetabling, chemistry, communication networks and computer science. For the most part the material is accessible to any reader with a graduate understanding of mathematics. However, the book contains advanced sections requiring much more specialized knowledge, which will be of interest to specialists in combinatorics and graph theory.

ISBN: 9780511984068Subjects--Topical Terms:

753009
Bipartite graphs.

LC Class. No.: QA166.14 / .A85 1998

Dewey Class. No.: 511.5

Bipartite graphs and their applications
LDR:01932nmm a2200289 a 4500 001 2227345
003 UkCbUP
005 20151005020622.0
006 m d
007 cr nn 008maaau
008 210414s1998 enk o 1 0 eng d
020 $a 9780511984068 $q (electronic bk.)
020 $a 9780521593458 $q (hardback)
020 $a 9780521065122 $q (paperback)
035 $a CR9780511984068
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA166.14 $b .A85 1998
082 0 4 $a 511.5 $2 21
090 $a QA166.14 $b .A843 1998
100 1 $a Asratian, Armen S., $d 1957- $3 3470697
245 1 0 $a Bipartite graphs and their applications $h [electronic resource] / $c Armen S. Asratian, Tristan M.J. Denley, Roland Haggkvist.
246 3 $a Bipartite Graphs & their Applications
260 $a Cambridge : $b Cambridge University Press, $c 1998.
300 $a xi, 259 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cambridge tracts in mathematics ; $v 131
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 $a Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. However, sometimes they have been considered only as a special class in some wider context. This book deals solely with bipartite graphs. Together with traditional material, the reader will also find many unusual results. Essentially all proofs are given in full; many of these have been streamlined specifically for this text. Numerous exercises of all standards have also been included. The theory is illustrated with many applications especially to problems in timetabling, chemistry, communication networks and computer science. For the most part the material is accessible to any reader with a graduate understanding of mathematics. However, the book contains advanced sections requiring much more specialized knowledge, which will be of interest to specialists in combinatorics and graph theory.
650 0 $a Bipartite graphs. $3 753009
700 1 $a Denley, Tristan M. J., $d 1967- $3 3470698
700 1 $a Haggkvist, Roland, $d 1950- $3 3470699
830 0 $a Cambridge tracts in mathematics ; $v 131. $3 3470700
856 4 0 $u https://doi.org/10.1017/CBO9780511984068