Bun pentru tine -
Reputation
Top tag
Next privilege 10 Rep.
 Oct3 awarded Student Nov24 awarded Peer Pressure Nov5 comment Prove that if there are $vw ∈ E(G)$ such that $f(v) \neq f(w)$ then $G$ contains the graph $P_4$ as an induced subgraph This is all the proof? Nov5 comment Prove that if $G$ is P4-free then any two vertices $u$ and $v$ are in the same connected component if and only if $f(u) = f(v)$ Thank you! but why the drawing is only f (u) and v? Nov5 comment Prove that if $G$ is P4-free then any two vertices $u$ and $v$ are in the same connected component if and only if $f(u) = f(v)$ Draw the graph for this exercise, please Nov4 comment Prove that if there are $vw ∈ E(G)$ such that $f(v) \neq f(w)$ then $G$ contains the graph $P_4$ as an induced subgraph Prove that if G is P4-free then any two vertices u and v are in the same connected component if and only if f(u)=f(v) Nov3 asked Prove that if $G$ is P4-free then any two vertices $u$ and $v$ are in the same connected component if and only if $f(u) = f(v)$ Nov2 comment Prove that if there are $vw ∈ E(G)$ such that $f(v) \neq f(w)$ then $G$ contains the graph $P_4$ as an induced subgraph an example , please Nov2 comment Prove that if there are $vw ∈ E(G)$ such that $f(v) \neq f(w)$ then $G$ contains the graph $P_4$ as an induced subgraph Draw the graph for this exercise, please Nov2 asked Prove that if there are $vw ∈ E(G)$ such that $f(v) \neq f(w)$ then $G$ contains the graph $P_4$ as an induced subgraph