×

Productive and inductive constructions of graphs. (English) Zbl 0638.05026

In the author’s paper in Acta Univ. Carol., Math. Phys. 25, No.2, 3-10 (1984; Zbl 0567.05045), there is given a characterization of families of antireflexive graphs in which any induced subgraph of a subdirectly irreducible (SI) graph is again SI. In this paper is the same problem solved for the class of all graphs (binary relations) without the assumption of antireflexivity. There are described 24 types of families of graphs in which subdirect irreducibility is hereditary with respect to induced subgraphs.
Reviewer: J.Vinárek

MSC:

05C20 Directed graphs (digraphs), tournaments

Citations:

Zbl 0567.05045