Algorithms and probabilistic bounds for the chromatic number of random composite graphs
Ph. D. in Computer Science
University of Missouri--Rolla
xv, 373 pages
© 1990 Jack L. Oakes, All rights reserved.
Dissertation - Citation
Print OCLC #
Link to Catalog Record
Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b2322506~S5
Oakes, Jack L., "Algorithms and probabilistic bounds for the chromatic number of random composite graphs" (1990). Doctoral Dissertations. 794.
Share My Dissertation If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.