A characterisation of all vertex-transitive finite graphs of connectivity < 5
arXiv:2602.09811
Abstract
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 decompositions.
26 pages, 7 figures. We are splitting up arXiv:2504.00760 into two parts; this is the second part