Jawhari, El Moustafa; Pouzet, Maurice; Rival, Ivan A classification of reflexive graphs: The use of ”holes”. (English) Zbl 0618.05041 Can. J. Math. 38, 1299-1328 (1986). A reflexive graph is an undirected graph with a loop at every vertex. A subgraph H of G is a retract of G if there is an edge-preserving map f of V(G) to V(H) which maps every vertex of H to itself. A reflexive graph variety is a class C of reflexive graphs which contains all direct products of members of C and which contains all retracts of members of C. It is shown (among others) that the lattice (with respect to inclusion) of reflexive graph varieties contains an infinite chain. Reviewer: Ján Plesník (Bratislava) Cited in 1 ReviewCited in 7 Documents MSC: 05C99 Graph theory Keywords:retraction; reflexive graph; direct products PDFBibTeX XMLCite \textit{E. M. Jawhari} et al., Can. J. Math. 38, 1299--1328 (1986; Zbl 0618.05041) Full Text: DOI