hw5(4) - CS 373U: Combinatorial Algorithms, Spring 2004...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 373U: Combinatorial Algorithms, Spring 2004 Homework 5 Due Wednesday, April 28, 2004 at noon Name: Net ID: Alias: Name: Net ID: Alias: Name: Net ID: Alias: For each numbered problem, if you use more than one page, staple all those pages together. Please do not staple your entire homework together. This will allow us to more easily distribute the problems to the graders. Remember to print the name and NetID of every member of your group, as well as the assignment and problem numbers, on every page you submit. You do not need to turn in this cover page. As with previous homeworks, we strongly encourage you to begin early. This will be the last graded homework. # 1 2 3 4 5 Total Score Grader
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS 373U Homework 5 (due April 28, 2004) Spring 2004 1. (a) Prove that every graph with the same number of vertices and edges has a cycle. (b) Prove that every graph with exactly two fewer edges than vertices is disconnected. Both proofs should be entirely self-contained. In particular, they should not use the word
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/14/2011 for the course ECON 101 taught by Professor Smith during the Spring '11 term at West Virginia University Institute of Technology.

Page1 / 2

hw5(4) - CS 373U: Combinatorial Algorithms, Spring 2004...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online