Consider the following four families of graphs: A = fcomplete graphsg, B = fcyclesg, C = fstarsg, D = fcomplements of bipartite graphsg.

Consider the following four families of graphs: A = fcomplete graphsg, B = fcyclesg,C = fstarsg, D = fcomplements of bipartite graphsg. For each pair of these families,determine all graphs that belong to both families in the pair. The word determine” means,in particular, that you have to prove that there are no other graphs that belong to bothfamilies in the pair than your answer gives.

Leave a Reply