Wilkinson, John Fergas (1965) A coloring problem related to Konig's Theorem. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-01222004-114035
A connection is shown between Konig's Theorem on 0-1 matrices and theorems giving sufficient conditions, in terms of certain forbidden subgraphs, for a graph G to have chromatic number equal to the maximum number of vertices in any clique of G. A conjecture is proposed which would, if true, give the best possible such theorem. Three special cases of this conjecture are proved, and Konig's Theorem is shown to be an easy corollary of any one of them.
|Item Type:||Thesis (Dissertation (Ph.D.))|
|Degree Grantor:||California Institute of Technology|
|Division:||Physics, Mathematics and Astronomy|
|Thesis Availability:||Public (worldwide access)|
|Defense Date:||1 April 1965|
|Default Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Imported from ETD-db|
|Deposited On:||28 Jan 2004|
|Last Modified:||26 Dec 2012 02:28|
- Final Version
See Usage Policy.
Repository Staff Only: item control page