Leroy M. Kelly

Learn More
A graph is said to be k-chromatic if its vertices can be split into k classes so that two vertices of the same class ase not connected (by an edge) and such a splitting is not possible for 7c-1 classes. Tutte was the first to show that for every k there is a k-chromatic graph which contains no triangle [l]. The lower girth of a graph is defined as the(More)
J. H. Bell, Gerald Berman, R. A. Beth, H. L. Black, M. I. Blyth, Richard Brauer, R. W. Bryant, R. E. Carr, Joshua Chover, R. V. Churchill, Harvey Cohn, A. H. Copeland, Max Coral, M. L. Curtis, D. A. Darling, Ben Dushnik, Benjamin Epstein, J. S. Frame, Cornelius Groenewoud, V. G. Grove, H. A. Hanson, Frank Harary, Gerald Harrison, H. L. Harter, G. E. Hay,(More)
  • 1