zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Graph classes: a survey. (English) Zbl 0919.05001
SIAM Monographs on Discrete Mathematics. and Applications, 3. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. xi, 304 p. $ 68.00 (1999).
In the past years, hundreds of graph classes have been invented and studied, both with respect to their structural properties as to their algorithmic complexity. In this book, many important graph classes are reviewed and discussed, with respect to these properties. The book discusses over 200 graph classes, their relations (which graph class is properly contained in which graph class), and key theorems. Both structural results are given (e.g., equivalent characterization of a graph property) and algorithmic behaviour is discussed, e.g., what is the complexity of deciding if a given graph belongs to the class, or polynomial time solvability or NP-completeness of important problems restricted to the class. The material is organized with respect to types of properties: there are fourteen chapters on subjects like perfect graphs (and generalizations and related concepts), forbidden subgraphs, distance properties, and more. Theorems are given without a proof, but with a reference to the literature where the result can be found. There are 1098 references. In this way, the book provides an encyclopedic overview of very many results that are important for researchers on graph classes, and is very useful as a work of reference for those working in the field.

MSC:
05-02Research monographs (combinatorics)
05CxxGraph theory
05C75Structural characterization of families of graphs
05C85Graph algorithms (graph theory)
WorldCat.org
Full Text: DOI