A characterisation of all vertex-transitive finite graphs of connectivity < 5

Jan Kurkofka, Tim Planken

We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical d…