Maximum degree in graphs of diameter 2. - Paul Erdös; Siemion Fajtlowicz; Alan J. Hoffman (Networks, 1980)

On the conjecture of Hajós. - Paul Erdös; Siemion Fajtlowicz (Comb., 1981)

Independence, clique size and maximum degree. - Siemion Fajtlowicz (Comb., 1984)

On conjectures of Graffiti. - Siemion Fajtlowicz (Discret. Math., 1988)

A characterization of radius-critical graphs. - Siemion Fajtlowicz (J. Graph Theory, 1988)

Degree sequences in triangle-free graphs. - Paul Erdös; Siemion Fajtlowicz; William Staton (Discret. Math., 1991)

Ramseyan Properties of Graphs. - Ermelinda DeLaViña; Siemion Fajtlowicz (Electron. J. Comb., 1996)

Graphs of diameter two with no 4-circuits. - J. Adrian Bondy; Paul Erdös; Siemion Fajtlowicz (Discret. Math., 1999)

On Some Conjectures of Griggs and Graffiti. - Ermelinda DeLaViña; Siemion Fajtlowicz; William Waller (Graphs and Discovery, 2001)

On The Representation and Characterization of Fullerene C60. - Siemion Fajtlowicz (Graphs and Discovery, 2001)