Herbert S. Shank

Available identifiers

zbMath Open shank.herbert-sMaRDI QIDQ1074590

List of research outcomes

Publication	Date of Publication	Type
Defining Bernoulli Polynomials in Z/pZ (A Generic Regularity Condition)	1990-01-01	Paper
The Gauss code problem off the plane	1987-01-01	Paper
Edge‐disjoint spanning trees: A connectedness theorem	1985-01-01	Paper
The cycle space of an embedded graph	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3680853	1984-01-01	Paper
Clique coverings of graphs V: maximal-clique partitions	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3933010	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3950573	1981-01-01	Paper
The rational case of a matrix problem of Harrison	1979-01-01	Paper
Full 4-colorings of 4-regular maps	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3872484	1979-01-01	Paper
Analogs of Bernoulli polynomials in fields \(\mathbb{Z}_p\)	1976-01-01	Paper
On the functional equation \(f(x)=\sum^{k-1}_{j=0}f((x+j)/k)\) over finite rings.	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4063182	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4074926	1975-01-01	Paper
On the undecidability of finite planar cubic graphs	1972-01-01	Paper
Records of turing machines	1971-01-01	Paper
Graph property recognition machines	1971-01-01	Paper
On the undecidability of finite planar graphs	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5574712	1970-01-01	Paper
Two memory bounds for the recognition of primes by automata	1969-01-01	Paper
Two memory bounds for the recognition of primes by automata	1969-01-01	Paper
On the Recognition of Primes by Automata	1968-01-01	Paper
An Algebraic Proof of Kirchhoff's Network Theorem	1961-01-01	Paper

Research outcomes over time

This page was built for person: Herbert S. Shank