H. Shank

According to our database, H. Shank authored at least 7 papers between 1968 and 1985.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1985

Edge-disjoint spanning trees: A connectedness theorem.

Martin Farber, B. Richter, H. Shank

J. Graph Theory, 1985

1984

The cycle space of an embedded graph.

B. Richter, H. Shank

J. Graph Theory, 1984

1982

Erratum: On the edge-coloring problem for a class of 4-regular maps.

François Jaeger, H. Shank

J. Graph Theory, 1982

1981

On the edge-coloring problem for a class of 4-regular maps.

François Jaeger, H. Shank

J. Graph Theory, 1981

1979

Full 4-colorings of 4-regular maps.

Kenneth A. Berman, H. Shank

J. Graph Theory, 1979

1969

Two Memory Bounds for the Recognition of Primes by Automata.

Juris Hartmanis, H. Shank

Math. Syst. Theory, 1969

1968

On the Recognition of Primes by Automata.

Juris Hartmanis, H. Shank

J. ACM, 1968