Exercises in Graph Theory
By: by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich
Contributors: Sarvanov, V.; Tyshkevich, R.; Yemelichev, V.; Zverovich, I.
Series: Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series -- 19; Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series -- 19
Publisher: Springer Netherlands
Published: 1998
Place of publication: Dordrecht
Language: eng
Format: [electronic resource] /
Number of pages: 355
ISBN-13: 9789048149797; 9789401715140
Subjects: Systems engineering; Computational complexity; Engineering; Combinatorics; Mathematical optimization; Computer engineering
Description: This volume covers the principal branches of graph theory in more than a thousand exercises of varying complexity. Each section starts with the main definitions and a brief theoretical discussion, which will serve as a reminder when solving the problems. Answers and hints are supplied separately. Topics include trees, independence and coverings, matchings, tours, planarity, colourings, degree sequences, connectivity, digraphs and hypergraphs. Audience: This work will be valuable to researchers, lecturers and graduate students in graph theory, combinatorics, VLSI design, circuits and systems, and mathematical programming and optimization.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.