SCEAS

The SCEAS System

Title:
Author:

Josef Lauri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

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

Search in 0.001secs, Finished in 0.002secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP