Tolerance graphs

The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.

著者

Golumbic, Martin Charles、 Bollobas B.、 Fulton W.、 Golumbic M.C.、 Katok A.、 Kirwan F.、 Sarnak P.、 Simon B.、 Totaro B.、Trenk Ann N.

出版社

Cambridge University Press

発売日

2004年1月発売

価格

価格未定（税込・書誌情報提供：openBD）

ISBN

9780521827584

発売済み