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)
Subgraph isomorphism, matching relational structures and maximal cliques. (English) Zbl 0374.05043

MSC:
05C35Extremal problems (graph theory)
05C10Topological graph theory
05C99Graph theory
68Q25Analysis of algorithms and problem complexity
WorldCat.org
Full Text: DOI
References:
[1] Ambler, A. P.; Barrow, H. G.; Brown, C. M.; Burstall, R. M.; Popplestone, R. J.: A versatile computer-controlled assembly system. Proc. of third intern. Joint conf. Artificial intelligence, 298-307 (1973) · Zbl 0303.68058
[2] Bron, C.; Kerbosch, J.: Algorithm 457: finding all the cliques of an undirected graph. C.a.c.m. 16, 575 (1973) · Zbl 0261.68018
[3] Johnston, H. C.: Cliques of a graph -- large or small. (1974)
[4] Karp, R. M.: Reducibility among combinatorial problems. Complexity of computer computations, 85-103 (1972)