3
$\begingroup$

Possible Duplicate:
Havel-Hakimi Theorem

Hi. I'm a beginner at graph theory, and I recently came across the Havel-Hakimi Theorem which is used to determine whether a sequence of integers is graphical. I am using Chartrand and Zhang's Introduction to Graph Theory, but I feel that the proof they provide is lacking. I am wondering whether anyone is aware of a proof for this theorem or where I can find one, preferably an easier one.

Thanks.

  • 0
    I'm sorry, is it possible to move it over to that forum?2011-06-06

2 Answers 2

1

The proof in the book "Pearls in Graph Theory" here is quite clear.

0

Look at pages 44 and page 45 of the second edition of Doug West's book Introduction to Graph Theory for what I think is a clear account accompanied by a worked out example.