HW-6-solution.pdf - Math 485, Graph Theory, Fall 2016...

This preview shows page 1 - 2 out of 2 pages.

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

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 2 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
staff

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture