Finite $3$-connected homogeneous graphs

Cai Heng Li, Jin-Xin Zhou

A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an…