Gary S. Bloom

According to our database, Gary S. Bloom authored at least 7 papers between 1977 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

The smallest non-autograph.

Benjamin S. Baumer, Gary S. Bloom, Yijin Wei

Discuss. Math. Graph Theory, 2016

2001

Cost Optimal Multicast Trees for Multi-source Data Flows.

Kaliappa Nadar Ravindran, Ali Sabbir, Dmitri Loguinov, Gary S. Bloom

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

1994

Decompositions into Linear Forests and Difference Labelings of Graphs.

Gary S. Bloom, Sergio Ruiz

Discret. Appl. Math., 1994

1991

Foreword.

Gary S. Bloom, D. Frank Hsu

Discret. Math., 1991

1987

On unavoidable digraphs in orientations of graphs.

Gary S. Bloom, Stefan A. Burr

J. Graph Theory, 1987

1979

Connectivity, genus, and the number of components in vertex-deleted subgraphs.

Edward F. Schmeichel, Gary S. Bloom

J. Comb. Theory B, 1979

1977

A Counterexample to a Theorem of S. Piccard.

Gary S. Bloom

J. Comb. Theory A, 1977