In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ______

Graph G is obtained by adding vertex s to K_3,4 and making s adjacent to every vertex of K_3,4. The minimum number of colours required to edge-colour G is _____.

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices, $$n$$ is

In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?