Show simple item record

dc.creatorWilkinson, John Fergas
dc.date1965
dc.date.accessioned2012-06-07T15:48:17Z
dc.date.available2012-06-07T15:48:17Z
dc.date.issued2012-06-07
dc.identifierhttp://thesis.library.caltech.edu/271/1/Wilkinson_jf_1965.pdf
dc.identifierWilkinson, 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 <http://resolver.caltech.edu/CaltechETD:etd-01222004-114035>
dc.identifier.urihttps://repositorio.leon.uia.mx/xmlui/123456789/29748
dc.descriptionA 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.
dc.formatapplication/pdf
dc.relationhttp://resolver.caltech.edu/CaltechETD:etd-01222004-114035
dc.relationhttp://thesis.library.caltech.edu/271/
dc.titleA coloring problem related to Konig's Theorem
dc.typeThesis
dc.typeNonPeerReviewed


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record