h4 - o p q r 3 Prove that the output of INTERVAL-CLIQUE is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MATH 4171 Graph Theory SPRING 2006 Homework Set IV (4 problems) Due date : Monday 3-20-06 1. Let G = ( X,Y,E ) be an r -regular ( r > 0) bipartite graph. Prove that G has a perfect matching. 2. Find a maximum matching in the following graph. Prove the optimality by using Theorem 9.6. a b c d e f g h i j k l m n
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: o p q r 3. Prove that the output of INTERVAL-CLIQUE is a maximum clique. 4. Find a shortest closed walk that use each edge at least once. Justify the optimality of your solution. e a b c d Important —– No Late Homework Will be Accepted —–...
View Full Document

This note was uploaded on 02/17/2009 for the course MATH 4171 taught by Professor Lax,r during the Spring '08 term at LSU.

Ask a homework question - tutors are online