A Counterexample to a Theorem of S. Piccard. - Gary S. Bloom (J. Comb. Theory A, 1977)

Connectivity, genus, and the number of components in vertex-deleted subgraphs. - Edward F. Schmeichel; Gary S. Bloom (J. Comb. Theory B, 1979)

On unavoidable digraphs in orientations of graphs. - Gary S. Bloom; Stefan A. Burr (J. Graph Theory, 1987)

Foreword. - Gary S. Bloom; D. Frank Hsu (Discret. Math., 1991)

Decompositions into Linear Forests and Difference Labelings of Graphs. - Gary S. Bloom; Sergio Ruiz (Discret. Appl. Math., 1994)

Cost Optimal Multicast Trees for Multi-source Data Flows. - Kaliappa Nadar Ravindran; Ali Sabbir; Dmitri Loguinov; Gary S. Bloom (INFOCOM, 2001)

The smallest non-autograph. - Benjamin S. Baumer; Gary S. Bloom; Yijin Wei (Discuss. Math. Graph Theory, 2016)