nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Local-Sparing Design Methodology for Fault-Tolerant Multiprocessorsa a This research was supported in part by the Office of Naval Research under Contract N00014-85K0531 and N00014-90J1860, and in part by NSF Grants MIP-9210049 and MIP-9200526.
|
Dutt, S. |
|
1997 |
34 |
11 |
p. 25-50 26 p. |
artikel |
2 |
An Erdős-Ko-Rado Theorem For Signed Sets
|
Bollobás, B. |
|
1997 |
34 |
11 |
p. 9-13 5 p. |
artikel |
3 |
Biplanar Graphs:
|
Beineke, L.W. |
|
1997 |
34 |
11 |
p. 1-8 8 p. |
artikel |
4 |
Chirality Measures and Graph Representationsa a This work was supported by an operating research grant from the Natural Sciences and Engineering Research Council of Canada.
|
Mezey, P.G |
|
1997 |
34 |
11 |
p. 105-112 8 p. |
artikel |
5 |
Chordal Graph Models of Contingency Tables
|
Khamis, H.J. |
|
1997 |
34 |
11 |
p. 89-97 9 p. |
artikel |
6 |
Distance in Digraphs
|
Chartrand, G. |
|
1997 |
34 |
11 |
p. 15-23 9 p. |
artikel |
7 |
Edge Rotation and Edge Slide Distance Graphs
|
Jarrett, E.B. |
|
1997 |
34 |
11 |
p. 81-87 7 p. |
artikel |
8 |
Editorial
|
|
|
1997 |
34 |
11 |
p. xv- 1 p. |
artikel |
9 |
Editorial
|
|
|
1997 |
34 |
11 |
p. xiii- 1 p. |
artikel |
10 |
Graph Theory and the Amateur Cryptographer
|
Read, R.C. |
|
1997 |
34 |
11 |
p. 121-127 7 p. |
artikel |
11 |
Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs
|
Lewinter, M. |
|
1997 |
34 |
11 |
p. 99-104 6 p. |
artikel |
12 |
Some Small Sized Spanning Subgraphs of a Hypercube
|
Graham, N. |
|
1997 |
34 |
11 |
p. 51-57 7 p. |
artikel |
13 |
The Hidden Algorithm of Ore's Theorem on Hamiltonian Cycles
|
Palmer, E.M. |
|
1997 |
34 |
11 |
p. 113-119 7 p. |
artikel |
14 |
The Irregularity Cost of a Graph
|
Harary, F. |
|
1997 |
34 |
11 |
p. 59-63 5 p. |
artikel |
15 |
Transitional Values of Graphs* * Research supported in part by FONDECYT under Project 1941219 (94).
|
Hevia, H. |
|
1997 |
34 |
11 |
p. 65-79 15 p. |
artikel |