Roger Entringer is over 60.
Roger Entringer
Ars Comb. 35A, 3-10 (1993).
The genus imbedding of the Cartesian product G×K2 need not include a genus imbedding of its factor G
Craft, David L.; Schwenk, Allen J.
Ars Comb. 35A, 29-34 (1993).
Generalized degree sums and Hamiltonian graphs
Blum, Avrim; Gould, Ronald J.
Ars Comb. 35A, 35-54 (1993).
On decomposing complete graphs into trees
Wallis, W. D.
Ars Comb. 35A, 55-63 (1993).
Two classes of graphs which have ascending subgraph decompositions
Fu, Hung-Lin; Hu, Wei-Hsin
Ars Comb. 35A, 65-70 (1993).
The structure of the differentiation digraphs of binary sequences
Simmons, Gustavus J.
Ars Comb. 35A, 71-88 (1993).
On zero sum Ramsey numbers of multiple copies of a graph
Roditty, Y.
Ars Comb. 35A, 89-95 (1993).
Long cycles in the middle two levels of the Boolean lattice
Savage, Carla D.
Ars Comb. 35A, 97-108 (1993).
4-connected Halin graphs are 2-Hamiltonian connected
Barefoot, C. A.
Ars Comb. 35A, 109-128 (1993).
On the edge arboricity of a random graph
Catlin, P. A.; Chen, Zhi-Hong; Palmer, E. M.
Ars Comb. 35A, 129-134 (1993).
Submaps of maps. IV: Degree restricted nonplanar maps
Bender, Edward A.; Richmond, L. Bruce; Wormald, N. C.
Ars Comb. 35A, 135-142 (1993).
Node connectivity equals minimum degree for Pascal graphs
Brigham, Robert C.; Dutton, Ronald D.
Ars Comb. 35A, 143-154 (1993).
Gossiping in radio networks
Hakimi, S. L.; Schmeichel, E. F.
Ars Comb. 35A, 155-160 (1993).
Complete graph T-spans
Tesman, Barry A.
Ars Comb. 35A, 161-173 (1993).
On the complexity of colouring by digraphs with at most one directed cycle
Bang-Jensen, Jørgen; MacGillivray, Gary
Ars Comb. 35A, 175-186 (1993).
On a problem of Erdös and Lovász
de Caen, D.; Székely, L. A.
Ars Comb. 35A, 187-192 (1993).
A small embedding for partial Km∖Km−2 designs
Lindner, C. C.; Rodger, C. A.
Ars Comb. 35A, 193-201 (1993).
The relativized completeness of UP
Sun, Huicheng; Lu, Yizhong
Ars Comb. 35A, 203-208 (1993).
Further results on the neutrality of graphs
Seah, Eric
Ars Comb. 35A, 209-216 (1993).
The smallest order of a graph with domination number equal to two and with every vertex contained in a Kn
Erdős, Paul; Henning, Michael A.; Swart, Henda C.
Ars Comb. 35A, 217-223 (1993).
Some bounds and an algorithm for the edge-integrity of trees
Bagga, K. Jay; Beineke, L. W.; Pippert, R. E.; Sedlmeyer, R. L.; Lipman, M. J.
Ars Comb. 35A, 225-238 (1993).
Maximum matching among minimum dominating sets
Slater, Peter J.
Ars Comb. 35A, 239-249 (1993).
On the edge-reconstruction of maximal bipartite planar graphs
Zhao, Yue
Ars Comb. 35A, 251-256 (1993).
More rotation numbers for generalised stars
Cockayne, E. J.; Mynhardt, C. M.
Ars Comb. 35A, 257-270 (1993).
Total irredundance in graphs: Theory and algorithms
Hedetniemi, S. M.; Hedetniemi, S. T.; Jacobs, D. P.
Ars Comb. 35A, 271-284 (1993).
