Abstract: For a family of graphs H, a graph G is H-free if no induced subgraph of G is isomorphic to a graph in H. In this talk, I will present a new decomposition theorem and coloring algorithm for(2P_3,C_4,C_6)-free graphs. I will also give some background on Truemper configurations (thetas, pyramids, prisms, and wheels) and on proving decomposition theorems in general