We introduce a theorem on bipartite graphs, and some theorems on chains of two and three complete graphs, considering when they are combination or non-combination graphs, present some families of combination graphs. We give a survey for trees of order \(\leq 10\), which are all combination graphs.