Problems in Graph Coloring and Graph Structure

Kim, Seog-Jin

Use this link to cite this item:

Files in this item

Files	Description	Format
application/pdf 3111558.pdf (4MB)	(no description provided)	PDF

Title:	Problems in Graph Coloring and Graph Structure
Author(s):	Kim, Seog-Jin
Doctoral Committee Chair(s):	West, Douglas B.
Department / Program:	Mathematics
Discipline:	Mathematics
Degree Granting Institution:	University of Illinois at Urbana-Champaign
Degree:	Ph.D.
Genre:	Dissertation
Subject(s):	Mathematics
Abstract:	Let F be a family of translates of a fixed convex set in the plane, and let G be the intersection graph of F . We studied the chromatic number of the complement of G. We also studied the transversal number of F , where the transversal number is the minimum size of a set of points that intersects all convex sets in F .
Issue Date:	2003
Type:	Text
Language:	English
Description:	88 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.
URI:	http://hdl.handle.net/2142/86826
Other Identifier(s):	(MiAaPQ)AAI3111558
Date Available in IDEALS:	2015-09-28
Date Deposited:	2003