Diameter vulnerability of graphs. - Claudine Peyrat (Discret. Appl. Math., 1984)

On iterated clique graphs with increasing diameters. - Claudine Peyrat; Douglas F. Rall; Peter J. Slater (J. Graph Theory, 1986)

Sufficient conditions for maximally connected dense graphs. - Terunao Soneoka; Hiroshi Nakada; Makoto Imase; Claudine Peyrat (Discret. Math., 1987)

Connectivity of Imase and Itoh Digraphs. - Nathalie Homobono; Claudine Peyrat (IEEE Trans. Computers, 1988)

Fault-tolerant routings in Kautz and de Bruijn networks. - Nathalie Homobono; Claudine Peyrat (Discret. Appl. Math., 1989)

Graphs such that every two edges are contained in a shortest cycle. - Nathalie Homobono; Claudine Peyrat (Discret. Math., 1989)

Large fault-tolerant interconnection networks. - Jean-Claude Bermond; Nathalie Homobono; Claudine Peyrat (Graphs Comb., 1989)

Induced Subgraphs of the Power of a Cycle. - Jean-Claude Bermond; Claudine Peyrat (SIAM J. Discret. Math., 1989)

Broadcasting in a Hypercube when Some Calls Fail. - Pierre Fraigniaud; Claudine Peyrat (Inf. Process. Lett., 1991)

Connectivity of kautz networks. - Jean-Claude Bermond; Nathalie Homobono; Claudine Peyrat (Discret. Math., 1993)

Broadcasting in an n-grid with a given neighborhood template. - Christine Garcia; Claudine Peyrat (HICSS (2), 1995)

Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays. - Jean-Claude Bermond; Claudine Peyrat; I. Sakho; Maurice Tchuenté (J. Parallel Distributed Comput., 1996)

Large Cayley Graphs on an Abelian Group. - Christine Garcia; Claudine Peyrat (Discret. Appl. Math., 1997)

A single-copy minimal-time simulation of a torus of automata by a ring of automata. - Bruno Martin; Claudine Peyrat (Discret. Appl. Math., 2007)