MATH 454-001 Graph Theory and Applications (Ellis)

Skip down to homework assignments
Instructor: Robert Ellis Office: E1 Bldg, Rm 105C Email:

Lectures

 MWF 11-11:50am E1 Bldg. 244

Office Hours

 M 1:30-2:30pm general office hour,
R 2:00-3:00pm Math 454 Priority office hour, and
R 4:45-5:45pm Math 152 Priority office hour		 Office phone 567-5336

Teaching Assistant

 TBA  

Textbook

 West, Introduction to Graph Theory, 2nd edition, Prentice Hall

First day handout (pdf) (course contract & exam schedule)

IIT Math 454 sections schedule

Supplemental Reading (books at Galvin Library)

For alternative points of view and for additional applications:
Graphs and Applications: An Introductory Approach, J.M.Aldous R.J.Wilson
Applied Combinatorics, F.R.Roberts
Applied Combinatorics, A.Tucker
Graph Theory, R.Diestel
Graph Theory Applications, L.R.Foulds
Topics in Intersection Graph Theory, T.A.McKee F.R.McMorris
Introduction to Graph Theory, D.B.West
Graph Theory and Applications, Marshall
Bipartite Graphs and their Applications, A.S.Asratian, T.MJ Denley, R.Haggkvist

 

Homework Due Dates

Due Date Assignment Optional (recommended) problems not to turn in
W 8/31 Sect. 1.1, p15: 11, 13, 14
F 9/2 Sect. 1.1, p15: 15
W 9/21 Sect. 1.2, p33: 31
F 9/23 Sect. 1.2, p31: 1, 6, 9, 15, 20 Sect. 1.2, p31: 2, 4, 8, 10, 18, 28
F 9/30 Rework up to 2 problems (#1 is a single problem) to replace their scores from the previous homework due 9/23. Also:
Sect. 1.3, p47: 2, 12, 17, 26, 41 (the first three shouldn't be that long)		 Sect. 1.3, p47: 5, 10, 14, 20, 32
F 10/7 Sect. 1.3, p47: 8, and Choose two out of these four: (57, 59, 63, 64)
Sect. 1.4, p.63: 3, and Choose one out of these three: (5, 10, 11)
Submitting more than the required number of solutions will result in the specified number being graded at random. 		Sect. 1.3, p47: 6, 7, 32, 40
Sect. 1.4., p63: 4, 6, 7, 14
M 10/24 Sect. 2.1: 7, 13, and two of these three: (18, 26, 44)
Sect. 2.2: 1, 2, 3 and one of these two: (7, 10) 		Sect. 2.1: 3, 8, 11, 12, 17
Sect. 2.2: 5, 6, 8, 12
M 10/31 Sect. 2.3: 2, 3 and one of these three: (10, 11, 14)
Sect. 3.1: 1, and one of these two: (8, 9) 		Sect. 2.3: 5, 13
Sect. 3.1: 2, 3, 4, 5, 11
W 11/9 Sect. 3.1: 19
Sect. 3.2: 1, 2 (Note: the Hungarian algorithm is the one that uses edge weights), 5,
Sect 3.3: 1, 3 		 
F 11/18 Sect. 3.3: 7
Sect. 4.1: 1, 4, 8 		Sect. 4.1: 2, 5, 6, 7, 9, 10, 14, 15 (choose a few)
F 12/9 See this page

page maintained by Robert Ellis / http://math.iit.edu/~rellis/