GATE 1997

February 2, 2024

Question 10014 – Graph-Theory

February 2, 2024

GATE 1997

February 2, 2024

Question 10014 – Graph-Theory

February 2, 2024

GATE 1990

Question 19

Choose the correct alternatives (More than one may be correct).

A graph is planar if and only if,

A
It does not contain subgraphs homeomorphic to k5 and k3,3.
B
It does not contain subgraphs isomorphic to k5 or k3,3.
C
It does not contain a subgraph isomorphic to k5 or k3,3.
D
It does not contain a subgraph homeomorphic to k5 or k3,3.
Question 19 Explanation: 
A graph is non-planar if and only if it contains a subgraph which is homomorphic to k5or k3,3. This is kuratowshi theorem.
Correct Answer: D
Question 19 Explanation: 
A graph is non-planar if and only if it contains a subgraph which is homomorphic to k5or k3,3. This is kuratowshi theorem.

Leave a Reply

Your email address will not be published. Required fields are marked *