Choose the most appropriate definition of plane graph 

• A. A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
• B. A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non - empty disjoint subset X and Y in such a way that each edge of G has one end in X and one end in Y
• C. A simple graph which is Isomorphic to Hamiltonian graph
• D. None of these