We present in Section 7.3 a short proof of Thomassen [Th97c] which is based on two other important results in the Robertson-Seymour theory, namely Theorem 7.2.1 (well-quasi-ordering of graphs of ...

Some math conjectures and theorems and proofs can take on a profound ... In other words, you make as many tree graphs as you can with a combination of different colored units referred to as ...

Emphasis will be placed on the algorithmic aspects of the area. Topics to be covered include: Brief Introduction to discrete mathematics and graph theoretic terminology; Ramsey's Theorem; matchings ...