Let be any class of finite graphs. A graph is -ultrahomogeneous if every isomorphism between induced subgraphs belonging to extends to an automorphism of . We study finite graphs that are -ultrahomogeneous, where is the class of complete graphs. We also explicitly classify the finite graphs that are -ultrahomogeneous, where is the class of disjoint unions of complete graphs.