Search the dblp DataBase
Timothy R. S. Walsh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Leonid M. Koganov, Valery A. Liskovets, Timothy R. S. Walsh
Total Vertex Enumeration in Rooted Planar Maps. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1999, v:54, n:, pp:- [Journal] - Valery A. Liskovets, Timothy R. S. Walsh
Enumeration of eulerian and unicursal planar maps. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:282, n:1-3, pp:209-221 [Journal] - Valery A. Liskovets, Timothy R. S. Walsh
Counting unrooted loopless planar maps. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2005, v:26, n:5, pp:651-663 [Journal] - Timothy R. S. Walsh
Counting labelled three-connected and homeomorphically irreducible two-connected graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1982, v:32, n:1, pp:1-11 [Journal] - Timothy R. S. Walsh
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1982, v:32, n:1, pp:12-32 [Journal] - Timothy R. S. Walsh
Counting non-isomorphic three-connected planar maps. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1982, v:32, n:1, pp:33-44 [Journal]
Search in 0.001secs, Finished in 0.001secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002