Math 485, Graph Theory, Fall 2016Homework #6Due on Friday, October 28th, 2016.Problem 1.Do problem 5.34, page 129 of the textbook.Problem 2.Do problem 5.36, page 130 of the textbook.
Get answer to your question and much more
Problem 3.Find a minimalu-vseparating set and a maximal set of internally disjointu-vpaths in thefollowing graph. Explain how Menger’s theorem can be used to justify your answers.