The octahedral graph is the graph obtained from by removing a perfect matching; equivalently it is . Its chromatic number is three, and it contains two vertex-disjoint triangles in a graph. A complete bipartite graph with a single additional internal edge cannot contain it: every triangle in that host uses the additional edge.
New to topics? Read the docs here!