2 papers
math.CO2022
Properties of uniformly -connected graphs
Frank Göring, Tobias Hofmann
A graph on at least vertices is uniformly -connected if each pair of its vertices is connected by and not more than independent paths. We reinvestigate a recent…
math.MG2020
The Edge-transitive Polytopes that are not Vertex-transitive
Frank Göring, Martin Winter
In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that a…