Tolerance graphs / Martin Charles Golumbic, Ann N. Trenk.

Format:

Book

Author/Creator:

Golumbic, Martin Charles, author.

Trenk, Ann N., author.

Series:

Cambridge studies in advanced mathematics ; 89.

Cambridge studies in advanced mathematics ; 89

Language:

English

Subjects (All):

Graph theory.

Physical Description:

1 online resource (xii, 265 pages) : digital, PDF file(s).

Edition:

1st ed.

Place of Publication:

Cambridge : Cambridge University Press, 2004.

Language Note:

English

Summary:

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.

Contents:

Introduction

Early work on tolerance graphs

Trees, cotrees and bipartite graphs

Interval probe graphs

Bitolerance graphs and ordered sets

Unit and 50% tolerance graphs

Comparability and invariance results

Bounded bitolerance recognition

Algorithms on tolerance graphs

The hierarchy of bitolerance orders

Tolerance models on trees

Phi-tolerance models

Directed tolerance graphs

Open questions and further directions.

Notes:

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

Includes bibliographical references (p. 253-259) and indexes.

ISBN:

1-107-14728-X

1-280-44950-0

9786610449507

0-511-18563-4

0-511-18480-8

0-511-18745-9

0-511-31356-X

0-511-54298-4

0-511-18652-5

OCLC:

319033335