Which complete graph is not present in minor of Outer Planar Graph?

Related MCQs

• Which graph cannot contain K3, 3 as a minor of graph?
• Consider a complete graph G with 4 vertices. The graph G has          spanning trees.
• Is every complete bipartite graph a Moore Graph.
• Is it true that every complete bipartite graph is a modular graph.
• A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
• A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
• Which of the following is called the “ultimate planar convex hull algorithm”?
• Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
• Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?
• Which term defines all the complete bipartite graph that are trees?