Answered You can hire a professional tutor to get the answer.
QUESTION
Find a connected bipartite graph G with a minimal number of vertices such that (a) Each vertex has multyplicity either 3 or 4.
Find a connected bipartite graph G with a minimal number of vertices such that
(a) Each vertex has multyplicity either 3 or 4.
(b) X = Y where X and Y are as in the previous problem
(c) there is no complete matching
