Algorithmic Graph Theory and Perfect Graphs

Order-a Journal on the Theory of Ordered Sets and its Applications 3 (2):207–208 (1986)
  Copy   BIBTEX

Abstract

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory Beautifully written for the new mathematician or computer scientist Comprehensive treatment.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited.Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache & Mohsin Khan - 2017 - International Journal of New Computer Architectures and Their Applications 7 (3):89-94.
Neutrosophic graphs: a new dimension to graph theory.Vasantha Kandasamy & B. W. - 2015 - Bruxelles, Belgium: EuropaNova. Edited by K. Ilanthenral & Florentin Smarandache.
Graph structure and monadic second-order logic: a language-theoretic approach.B. Courcelle - 2012 - New York: Cambridge University Press. Edited by Joost Engelfriet.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.

Analytics

Added to PP
2023-09-18

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references