Search the dblp DataBase
Peter J. Owens: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Ján Nincák, Peter J. Owens
Note. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2004, v:24, n:2, pp:325-329 [Journal] - Igor Fabrici, Peter J. Owens, Hansjoachim Walther
Non-hamiltonian polyhedral graphs with two types of faces. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2000, v:213, n:1-3, pp:105-113 [Journal] - Stanislav Jendrol, Peter J. Owens
On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2001, v:17, n:4, pp:659-680 [Journal] - Stanislav Jendrol, Peter J. Owens
Erratum. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2003, v:19, n:4, pp:517-518 [Journal] - Peter J. Owens
Shortness parameters for polyhedral graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:206, n:1-3, pp:159-169 [Journal] - Jochen Harant, Peter J. Owens
Non-hamiltonian 4/5-tough maximal planar graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:147, n:1-3, pp:301-305 [Journal] - Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:150, n:1-3, pp:143-153 [Journal] - Stanislav Jendrol, Peter J. Owens
Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:137, n:1-3, pp:251-263 [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