Genus embeddings for some complete tripartite graphs. - Saul Stahl; Arthur T. White (Discret. Math., 1976)

Blocks and the nonorientable genus of graphs. - Saul Stahl; Lowell W. Beineke (J. Graph Theory, 1977)

Generalized Embedding Schemes. - Saul Stahl (J. Graph Theory, 1978)

The embeddings of a graph - A survey. - Saul Stahl (J. Graph Theory, 1978)

Self-dual embeddings of Cayley graphs. - Saul Stahl (J. Comb. Theory B, 1979)

A combinatorial analog of the Jordan Curve Theorem. - Saul Stahl (J. Comb. Theory B, 1983)

Permutations and Riemann Surfaces. - Saul Stahl (J. Comb. Theory A, 1984)

On The Product of Certain Permutations. - Saul Stahl (Eur. J. Comb., 1987)

A duality for permutations. - Saul Stahl (Discret. Math., 1988)

Region distributions of graph embeddings and stirling numbers. - Saul Stahl (Discret. Math., 1990)

Region distributions of some small diameter graphs. - Saul Stahl (Discret. Math., 1991)

Permutation-partition pairs. III. Embedding distributions of linear families of graphs. - Saul Stahl (J. Comb. Theory B, 1991)

An upper bound for the average number of regions. - Saul Stahl (J. Comb. Theory B, 1991)

On the number of maximum genus embeddings of almost all graphs. - Saul Stahl (Eur. J. Comb., 1992)

Bounds for the average genus of the vertex-amalgamation of graphs. - Saul Stahl (Discret. Math., 1995)

On the average genus of the random graph. - Saul Stahl (J. Graph Theory, 1995)

Cubic graphs whose average number of regions is small. - Clay Mauk; Saul Stahl (Discret. Math., 1996)

Note on the nth chromatic numbers of the Grötzsch graph. - Saul Stahl (J. Graph Theory, 1996)

The multichromatic numbers of some Kneser graphs. - Saul Stahl (Discret. Math., 1998)