bipartite graph

An undirected, unweighted, simple graph $G(V, E)$ is said to be 2 -colorable if there exists a function $c: V \rightarrow\{0,1\}$ such that for every $(u, v) \in E, c(u) \neq c(v)$...

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 _____.

The maximum number of edges in a bipartite graph on $$12$$ vertices is _________.

What is the chromatic number of an $$n$$-vertex simple connected graph which does not contain any odd length cycle? Assume $$n \ge 2$$.