For a class C of graphs, we define C-edge-brittleness of a graph G as the minimum ℓ such that the vertex set of G can be partitioned into sets inducing a subgraph in C and there are ℓ edges having ends in distinct parts. We characterize classes of graphs having bounded C-edge-brittleness for a class C of forests or a class C of graphs with no K4∖e topological minors in terms of forbidden obstructions. We also define C-vertex-brittleness of a graph G as the minimum ℓ such that the edge set of G can be partitioned into sets inducing a subgraph in C and there are ℓ vertices incident with edges in distinct parts. We characterize classes of graphs having bounded C-vertex-brittleness for a class C of forests or a class C of outerplanar graphs in terms of forbidden obstructions. We also investigate the relations between the new parameters and the edit distance.

A loopless digraph is a tournament if for every pair of distinct vertices $u$ and $v$, exactly one of $uv$ and $vu$ is an edge. For a tournament $T$, a set $S\subseteq V(T)$ is homogeneous if every vertex $v$ outside of $S$ is either complete to $S$ or complete from $S$. A tournament is prime if for every homogeneous set $S$ of $T$, either $|S| \le 1$ or $S=V(T)$. In this paper, we present a list of eight classes of prime tournaments and prove that for every positive integer $n$, there exists $N$ such that every prime tournament of size at least $N$ contains a prime tournaments from the list of size at least $n$.