![]()
AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name. |
|||||||
STUDIA INFORMATICA - Issue no. 1 / 2000 | |||||||
Article: |
WALLIS, W.D., "A BEGINNER''S GUIDE TO GRAPH THEORY", BIRKHUSER, BOSTON-BASEL-BERLIN, 2000, ISBN 0-8176-4176-9, 230PP.. Authors: TEODOR TOADERE. |
||||||
Abstract: This is a very good course on graph Theory for students in mathematics, com- puter science, engineers and psychologists. The author has taught "graph theory courses at the University of Newcastle and Southern Illinois University over the past 30 years". It is a lucid book and has attained a balance between the theoretical and prac- ticai approaches. The book is divided into 13 chapters and two appendices: Hint & Answers and Solutions. Each chapter presents theoretical notions, examples and exercises. The first four chapters introduce the reader in graph theory (it is presented the concepts of graphs, walks, paths, cycles, cuts, connectivity and tree). The flfth chapter deals with the apphcation of several vector spaces concepts graphs theory. The next four chapters presents: factorizations, graph coloring, planarity and Ramsey theory. Chapter 10 introduces directed graphs. The two following chapters are devoted to two important apphcation areas: criticai paths and network flows. The last chapter is dedicated for computaţional considerations. | |||||||
![]() |
|||||||