A coloring problem related to Konig's Theorem

A coloring problem related to Konig's Theorem

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, giv...

Full description

Bibliographic Details
Main Author: Wilkinson, John Fergas
Format: Others
Published: 1965
Online Access:https://thesis.library.caltech.edu/271/1/Wilkinson_jf_1965.pdf
Wilkinson, John Fergas (1965) A coloring problem related to Konig's Theorem. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/N6B0-QM91. https://resolver.caltech.edu/CaltechETD:etd-01222004-114035 <https://resolver.caltech.edu/CaltechETD:etd-01222004-114035>

Internet

https://thesis.library.caltech.edu/271/1/Wilkinson_jf_1965.pdf
Wilkinson, John Fergas (1965) A coloring problem related to Konig's Theorem. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/N6B0-QM91. https://resolver.caltech.edu/CaltechETD:etd-01222004-114035 <https://resolver.caltech.edu/CaltechETD:etd-01222004-114035>

Similar Items