A graph is              if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.

Related MCQs

• A                is a graph with no homomorphism to any proper subgraph.
• A graph is planar if and only if it does not contain ________.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• The graph is the smallest non-modular lattice N5. A lattice is                if and only if it does not have a                isomorphic to N5.
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            
• Berge graph is similar to              due to strong perfect graph theorem.
• A path of a graph is said to be ______ if it contains all the edges of the graph.
• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.