In every graph G:

a) The chromatic number of G is greater than or equal to the minimal degree of a vertex

b) If G is both Hamiltonian and Eulerian then every Hamiltonian cycle of G is Eulerian

c) If G is planar then G has at most one Hamiltonian cycle

d) If G is bipartite with partition {W,U} and every vertex of G has degree rr for some r>0r>0, then |W|=|U|

e) If every vertex of G has degree at least 2 then every vertex belongs to a cycle in G

f) If G contains KnKn as a subgraph then the chromatic number of G is at least n

This Question is a True False Question