A Caltech Library Service

A coloring problem related to Konig's Theorem

Wilkinson, John Fergas (1965) A coloring problem related to Konig's Theorem. Dissertation (Ph.D.), California Institute of Technology.


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
Major Option:Mathematics
Thesis Committee:
  • Jr., Marshall Hall, (chair)
Defense Date:1 April 1965
Record Number:etd-01222004-114035
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:271
Deposited By: Imported from ETD-db
Deposited On:28 Jan 2004
Last Modified:25 Dec 2012 14:58

Thesis Files

PDF (Wilkinson_jf_1965.pdf)
See Usage Policy.


Repository Staff Only: item control page