scientific article; zbMATH DE number 3995735
[For the entire collection see Zbl 0608.00005.] The inductive class \(I=Cn(B;R)\) is defined by giving the class B of initial objects - the basis of I, and the class R of generating rules. Any such rule applied to an appropriate sequence of objects, already in I, produces an object of I. The inductive class I consists exactly of the objects which can be constructed from the basis by a finite number of applications of the generating rules. Inductive definitions of classes of graphs are implicitly present in the inductive proofs of several graph theory theorems. But they can also be used to enumerate the graphs and they can reveal insight into the structure of the graphs from a given class. For these reasons inductive classes are of interest for their own sake. In the paper an introduction to inductive definitions of classes of graphs is given accompanied by a discussion of their characteristic properties and possible directions for future research.
- Inductive classes of bipartite cubic graphs
- An inductive definition of cubic toroidal maps
- scientific article; zbMATH DE number 3946183 (Why is no real title available?)
- On prime inductive classes of graphs
- Inductive definition of two restricted classes of triangulations
- An inductive definition of the class of 3-connected quadrangulations of the plane
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723778)