| 2000 |
|---|
| 10 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra,
Ralph Tindell:
On Isoperimetric Connectivity in Vertex-Transitive Graphs.
SIAM J. Discrete Math. 13(1): 139-144 (2000) |
| 1991 |
|---|
| 9 | EE | Ralph Tindell:
Covering Morphisms and Unique Minimal D-Schemes.
Acta Cybern. 10(1-2): 101-112 (1991) |
| 1990 |
|---|
| 8 | | Yahya Ould Hamidoune,
Ralph Tindell:
Vertex Transitivity and Super Line Connectedness.
SIAM J. Discrete Math. 3(4): 524-530 (1990) |
| 1987 |
|---|
| 7 | | Stephen L. Bloom,
Ralph Tindell:
A note on zero-congruences.
Acta Cybern. 8: 1-4 (1987) |
| 6 | EE | A. Satyanarayana,
Ralph Tindell:
Chromatic polynomials and network reliability.
Discrete Mathematics 67(1): 57-79 (1987) |
| 1983 |
|---|
| 5 | | Stephen L. Bloom,
Ralph Tindell:
Varieties of ``if-then-else''.
SIAM J. Comput. 12(4): 677-707 (1983) |
| 1982 |
|---|
| 4 | EE | Douglas Bauer,
Ralph Tindell:
Graphs isomorphic to subgraphs of their line-graphs.
Discrete Mathematics 41(1): 1-6 (1982) |
| 1980 |
|---|
| 3 | | Stephen L. Bloom,
Ralph Tindell:
Compatible Orderings on the Metric Theory of Trees.
SIAM J. Comput. 9(4): 683-691 (1980) |
| 1979 |
|---|
| 2 | | Stephen L. Bloom,
Ralph Tindell:
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes.
Theor. Comput. Sci. 9: 265-286 (1979) |
| 1978 |
|---|
| 1 | | Calvin C. Elgot,
Stephen L. Bloom,
Ralph Tindell:
On the Algebraic Atructure of Rooted Trees.
J. Comput. Syst. Sci. 16(3): 362-399 (1978) |
