| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A census of non-reconstructable digraphs, I: Six related families
|
Stockmeyer, Paul K.
|
|
1981
|
31 |
2 |
p. 232-239
8 p.
|
artikel
|
| 2 |
A characterization of binary geometries by a double elimination axiom
|
Fournier, J.-C.
|
|
1981
|
31 |
2 |
p. 249-250
2 p.
|
artikel
|
| 3 |
A result on Hamiltonian cycles in generalized Petersen graphs
|
Alspach, Brian
|
|
1981
|
31 |
2 |
p. 225-231
7 p.
|
artikel
|
| 4 |
List of forthcoming articles
|
|
|
1981
|
31 |
2 |
p. 251-
1 p.
|
artikel
|
| 5 |
Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory
|
Cheng, Ching-Shui
|
|
1981
|
31 |
2 |
p. 240-248
9 p.
|
artikel
|
| 6 |
Non-separating induced cycles in graphs
|
Thomassen, Carsten
|
|
1981
|
31 |
2 |
p. 199-224
26 p.
|
artikel
|
| 7 |
On a new digraph reconstruction conjecture
|
Ramachandran, S.
|
|
1981
|
31 |
2 |
p. 143-149
7 p.
|
artikel
|
| 8 |
On the arc-chromatic number of a digraph
|
Poljak, S.
|
|
1981
|
31 |
2 |
p. 190-198
9 p.
|
artikel
|
| 9 |
Primitive permutation groups and a characterization of the odd graphs
|
Praeger, Cheryl E.
|
|
1981
|
31 |
2 |
p. 117-142
26 p.
|
artikel
|
| 10 |
The asymptotic connectivity of labelled regular graphs
|
Wormald, Nicholas C.
|
|
1981
|
31 |
2 |
p. 156-167
12 p.
|
artikel
|
| 11 |
The asymptotic distribution of short cycles in random regular graphs
|
Wormald, Nicholas C.
|
|
1981
|
31 |
2 |
p. 168-182
15 p.
|
artikel
|
| 12 |
The relation between the height of a well-founded partial ordering and the order types of its chains and antichains
|
Schmidt, Diana
|
|
1981
|
31 |
2 |
p. 183-189
7 p.
|
artikel
|
| 13 |
The size of connected hypergraphs with prescribed covering number
|
Bollobás, Béla
|
|
1981
|
31 |
2 |
p. 150-155
6 p.
|
artikel
|
Tijdschrift beschrijving