这里给海南琼大来信表达很高兴担任海南琼州大学杂志编委的美国数学会副主席Anil Nerode大师的博士Herbert S. Shank哈密顿图著名论文:A Note on Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory ,Volume: 15, 1968,Issue: 1, P: 86 – 86(这篇论文是和海南琼州大学合作多篇论文的美国大师K.Thulasiraman院士编写的世界名著《图、网络与算法》的第三章“欧拉图和哈密顿图”这章引用的20个文献之一)

 

在美国数学评论的“Author”输入“Shank, Herbert S.”和“Shank, H.”见论文几乎是相同的,都是下面 20余篇论文并大多是图论论文:

Edge-disjoint spanning trees: a connectedness theoremJ. Graph Theory (1985), no. 3, 319—324单位:University of Waterloo

Left-right paths off the plane,

The cycle space of an embedded graphJ. Graph Theory (1984), no. 3, 365--369.

Clique coverings of graphs. V. Maximal-clique partitionsBull. Austral. Math. Soc. 25 (1982), no. 3, 337--356.

Erratum: "On the edge-coloring problem for a class of $4$-regular maps''. J. Graph Theory (1982), no. 1, 93.

Consecutive Eulerian tree graphsArs Combin. 12 (1981), 69--71. 

On the edge-coloring problem for a class of 4-regular mapsJ. Graph Theory (1981), no. 3, 269--275.

 Some parity results on binary vector spacesArs Combin. 8 (1979), 107--108.

The rational case of a matrix problem of HarrisonDiscrete Math. 28 (1979), no. 2, 207--212. 单位:University of Waterloo

Full $4$-colorings of 4-regular mapsJ. Graph Theory (1979), no. 3, 291--294.

Analogs of Bernoulli polynomials in fields Z\sb{p}Aequationes Math. 14 (1976), no. 3, 401--404.

On the functional equation $f(x)=\sum \sp{k-1}\sb{j=0}f((x+j)/k)$ over finite ringsAequationes Math. 13 (1975), no. 3, 229--232.

The theory of left-right path,

Left-right paths and the parity of the tree number. Colloque sur la Th'eorie des Graphes (Paris, 1974). Cahiers Centre Études Rech. Opér. 17 (1975), no. 2-4, 385--386. 

On the undecidability of finite planar cubic graphsJ. Symbolic Logic 37 (1972), 595--597.

 Records of Turing machinesMath. Systems Theory 5 (1971), 50--55.

Graph property recognition machinesMath. Systems Theory 5 (1971), 45--49. 

On the undecidability of finite planar graphsJ. Symbolic Logic 36 (1971), 121--126.

TOPICS IN MACHINE THEORY. Thesis (Ph.D.)–Cornell University. ProQuest LLC, Ann Arbor, MI, 1969. 26 pp(博士论文)

Two memory bounds for the recognition of primes by automataMath. Systems Theory 3 (1969), 125--129.

On the recognition of primes by automataJ. Assoc. Comput. Mach. 15 (1968), 382--389.

A Note on Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory ,Volume: 15, 1968,Issue: 1, P86  86(单位:Cornell University

 

一些相关的哈密顿图论文:

Richard L. CumminsHamilton Circuits in Tree Graphs IEEE Transactions on Circuit Theory ( Volume: 13, Issue: 1, March 1966)Page(s): 82 - 90

G. KishiY. KajitaniOn Hamilton Circuits in Tree Graphs IEEE Transactions on Circuit Theory ( Volume: 15, Issue: 1, Mar 1968)Page(s): 42 - 50

Wai-Kai ChenHamilton circuits in directed-tree graphs IEEE Transactions on Circuit Theory ( Volume: 14, Issue: 2, June 1967)Page(s): 231 - 233