It seems to be a fact that there are only five bounded connected non-selfintersecting polyhedra with identical regular-polygon faces and congruent vertices (i.e., you can pick a neighborhood of every vertex so that all the neighborhoods are congruent, this is sometimes called "locally vertex-transitive"), namely the platonic solids.
(Drop any one word in the above and you get more: unbounded allows an infinite linear chain of octahedra glued face to face; disconnected allows the union of two disjoint Platonic solids; self-intersecting allows two of the Kepler-Poinsot solids; non-identical allows Archimedean solids; irregular faces allows e.g. the noble disphenoid, and of course dropping congruent vertices allows a myriad of possibilities.) Note I have not included convex among the hypotheses.
However, I am hard-pressed to put together a proof of this. If you add the hypothesis that the polyhedron is genus 0, then Euler's formula shows you there must be an overall angle defect, so the same angle defect at each vertex since the vertices are congruent, and now you can do the usual three times the vertex angle must be less than a full circle, etc. (Even in the case of genus 1, Euler's formula just tells you that the angle sum must be 0 at each vertex, and then there are infinite solutions for both six triangles and four squares at each vertex -- basically infinitely long prisms, which are projectively speaking tori -- so you will really need to use the boundedness...)
Nevertheless, the genus-zero hypothesis doesn't seem to be necessary; there seem to be no higher-genus connected bounded non-selfintersecting polyhedra with identical regular-polygon faces and congruent vertices. Can anyone outline or point me to a proof of this fact?

I like the graph theory based argument. Let's talk about a simplicial 2-complex (hence complex) with $V$ vertices, $E$ edges, and $F$ faces, all greater than 0. A complex is regular if all vertices have the same degree $p$ and all faces have the same degree $q$ (here a face's degree is the number of edges--or 1-simplices--on its boundary). We won't allow degenerate faces, or faces whose degree is 2, so $q \geq 3$. We also don't want to allow a vertex next to only two faces, so $p \geq 3$.
Also, by the handshaking lemma, $2E = pV$ and $2E = qF$, or $V=\frac{2E}{p}$ and $F = \frac{2E}{q}$.
Euler's theorem is that $V - E + F = \chi$, which after substituion from above becomes
$$\frac{2E}{p} - E + \frac{2E}{q} = \chi$$ $$\Rightarrow \frac{1}{p} + \frac{1}{q} = \frac{1}{2} + \frac{\chi}{2E}$$
We now consider what integer values of $p\geq 3$ and $q \geq 3$ can satisfy this equation.
First look at the case where $\chi = 2$ (the sphere). In this case, we have that
$$\frac{1}{p} + \frac{1}{q} = \frac{1}{2} + \frac{1}{E}$$
Now assume that both $p > 3$ and $q > 3$, then $\frac{1}{p} + \frac{1}{q} \leq \frac{1}{2} < \frac{1}{2} + \frac{1}{E}$ (since $E > 0$). Therefore, at least one of $p$ and $q$ is 3. Without loss of generality, if $p = 3$, and $q \geq 6$ we again arrive at a contradiction, because $\frac{1}{p} + \frac{1}{q} \leq \frac{1}{2} < \frac{1}{2} + \frac{1}{E}$. In fact, you can work out the only pairs of $(p, q)$ that work are $(3, 3)$--tetrahedron, $(3, 4)$--cube, $(4, 3)$--octahedron, $(3,5)$--dodecahedron, and $(5, 3)$--icosahedron. (I'll leave that to you to check.)
Now, let's look at the torus, $\chi = 0$. In this case we have $\frac{1}{p} + \frac{1}{q} = \frac{1}{2}$. So $p = q = 4$ and (as pointed out in the comments) $\{p, q\} = \{3, 6\}$ work. We'll need some geometry to argue that those can't be built. I think it will stem from the fact that in each case, we have exactly $2\pi$ angle around each vertex. In the case of $p = 3$ and $q = 6$, there is only one way to lay out three hexagons around an interior vertex which is for all dihedral angles to be $\pi$, which clearly leads to a contradiction.
With the higher genus tori, many more values for $p$ and $q$ may work and so the geometry is going to have to play a bigger role.