| |
| 2003 | ||
|---|---|---|
| 9 | EE | Josef Lauri: Constructing graphs with several pseudosimilar vertices or edges. Discrete Mathematics 267(1-3): 197-211 (2003) |
| 2002 | ||
| 8 | Kevin J. Asciak, Josef Lauri: On Disconnected Graph with Large Reconstruction Number. Ars Comb. 62: (2002) | |
| 1997 | ||
| 7 | Josef Lauri: Pseudosimilarity in Graphs - A Survey. Ars Comb. 46: (1997) | |
| 6 | EE | Josef Lauri: On a formula for the number of Euler trails for a class of digraphs. Discrete Mathematics 163(1-3): 307-312 (1997) |
| 1996 | ||
| 5 | EE | Josef Lauri: Large sets of pseudosimilar vertices. Discrete Mathematics 155(1-3): 157-160 (1996) |
| 1994 | ||
| 4 | EE | S. Fiorini, Josef Lauri: Preface. Discrete Mathematics 124(1-3): 1 (1994) |
| 1983 | ||
| 3 | EE | Josef Lauri: Proof of Harary's conjecture on the reconstruction of trees. Discrete Mathematics 43(1): 79-90 (1983) |
| 1981 | ||
| 2 | EE | S. Fiorini, Josef Lauri: The reconstruction of maximal planar graphs. I. Recognition. J. Comb. Theory, Ser. B 30(2): 188-195 (1981) |
| 1 | EE | Josef Lauri: The reconstruction of maximal planar graphs II. Reconstruction. J. Comb. Theory, Ser. B 30(2): 196-214 (1981) |
| 1 | Kevin J. Asciak | [8] |
| 2 | S. Fiorini | [2] [4] |