Bipartite Graphs and their Applications
Armen S. Asratian · Tristan M. J. Denley · Roland Häggkvist
1998年8月 · Cambridge Tracts in Mathematics 第 131 冊 · Cambridge University Press
電子書
274
頁
report評分和評論未經驗證 瞭解詳情
關於本電子書
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.
為這本電子書評分
歡迎提供意見。
閱讀資訊
智慧型手機與平板電腦
筆記型電腦和電腦
你可以使用電腦的網路瀏覽器聆聽你在 Google Play 購買的有聲書。
電子書閱讀器與其他裝置
如要在 Kobo 電子閱讀器這類電子書裝置上閱覽書籍，必須將檔案下載並傳輸到該裝置上。請按照說明中心的詳細操作說明，將檔案傳輸到支援的電子閱讀器上。
