Saul Stahl - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

1998

The multichromatic numbers of some Kneser graphsSaul Stahl. DM, 185(1-3):287-291, 1998. [doi]

1996

Cubic graphs whose average number of regions is smallClay Mauk, Saul Stahl. DM, 159(1-3):285-290, 1996. [doi]

nth chromatic numbers of the Grötzsch graphSaul Stahl. jgt, 21(2):207-209, 1996. [doi]

1995

Bounds for the average genus of the vertex-amalgamation of graphsSaul Stahl. DM, 142(1-3):235-245, 1995. [doi]

On the average genus of the random graphSaul Stahl. jgt, 20(1):1-18, 1995. [doi]

1992

On the number of maximum genus embeddings of almost all graphsSaul Stahl. ejc, 13(2):119-126, 1992. [doi]

1991

Region distributions of some small diameter graphsSaul Stahl. DM, 89(3):281-299, 1991. [doi]

Permutation-partition pairs. III. Embedding distributions of linear families of graphsSaul Stahl. JCT, 52(2):191-218, 1991. [doi]

An upper bound for the average number of regionsSaul Stahl. JCT, 52(2):219-221, 1991. [doi]

1990

Region distributions of graph embeddings and stirling numbersSaul Stahl. DM, 82(1):57-78, 1990. [doi]

1988

A duality for permutationsSaul Stahl. DM, 71(3):257-271, 1988. [doi]

1987

On The Product of Certain PermutationsSaul Stahl. ejc, 8(1):69-72, 1987. [doi]

1984

Permutations and Riemann SurfacesSaul Stahl. JCT, 36(2):237-239, 1984.

1983

A combinatorial analog of the Jordan Curve TheoremSaul Stahl. JCT, 35(1):28-38, 1983. [doi]

1979

Self-dual embeddings of Cayley graphsSaul Stahl. JCT, 27(1):92-107, 1979. [doi]

1978

Generalized Embedding SchemesSaul Stahl. jgt, 2(1):41-52, 1978. [doi]

The embeddings of a graph - A surveySaul Stahl. jgt, 2(4):275-298, 1978. [doi]

1977

Blocks and the nonorientable genus of graphsSaul Stahl, Lowell W. Beineke. jgt, 1(1):75-78, 1977. [doi]

1976

Genus embeddings for some complete tripartite graphsSaul Stahl, Arthur T. White. DM, 14(3):279-296, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL