An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs. - Jean-Luc Fouquet; Igor Parfenoff; Henri Thuillier (Inf. Process. Lett., 1997)

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs. - Igor Parfenoff (J. Parallel Distributed Comput., 1998)

Triangulated Neighbourhoods in C4-Free Berge Graphs. - Igor Parfenoff; Florian Roussel; Irena Rusu (WG, 1999)

Loose vertices in C4-free Berge graphs. - Igor Parfenoff; Florian Roussel; Irena Rusu (Discret. Math., 2002)