nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast approximation algorithm for the multicovering problem
|
Hall, Nicholas G. |
|
1986 |
15 |
1 |
p. 35-40 6 p. |
artikel |
2 |
A polynomial algorithm for constructing the clique graph of a line graph
|
Hedman, Bruce |
|
1986 |
15 |
1 |
p. 61-66 6 p. |
artikel |
3 |
A property of real-time trellis automata
|
Yu, Sheng |
|
1986 |
15 |
1 |
p. 117-119 3 p. |
artikel |
4 |
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time
|
Feigenbaum, Joan |
|
1986 |
15 |
1 |
p. 105-110 6 p. |
artikel |
5 |
Editorial Board
|
|
|
1986 |
15 |
1 |
p. ii- 1 p. |
artikel |
6 |
Iterative characterizations of Boolean algebras
|
Simovici, Dan |
|
1986 |
15 |
1 |
p. 111-116 6 p. |
artikel |
7 |
Linear and combinatorial sharing problems
|
Zimmermann, Uwe |
|
1986 |
15 |
1 |
p. 85-104 20 p. |
artikel |
8 |
Maximal dynamic polymatroid flows and applications
|
Hamacher, Horst W. |
|
1986 |
15 |
1 |
p. 41-54 14 p. |
artikel |
9 |
On morphic generation of regular languages
|
Harju, T. |
|
1986 |
15 |
1 |
p. 55-60 6 p. |
artikel |
10 |
On the number of edges in the transitive closure of a graph
|
McColl, W.F. |
|
1986 |
15 |
1 |
p. 67-73 7 p. |
artikel |
11 |
On the ordering of graphs with respect to their matching numbers
|
Gutman, Ivan |
|
1986 |
15 |
1 |
p. 25-33 9 p. |
artikel |
12 |
On the order of the largest induced tree in a random graph
|
Palka, Zbigniew |
|
1986 |
15 |
1 |
p. 75-83 9 p. |
artikel |
13 |
Representative graphs of r-regular partial planes and representation of orthomodular posets
|
Anger, F.D. |
|
1986 |
15 |
1 |
p. 1-10 10 p. |
artikel |
14 |
The matching polynomial of a polygraph
|
Babić, Darko |
|
1986 |
15 |
1 |
p. 11-24 14 p. |
artikel |