Back to results

University of Illinois at Urbana-Champaign

Problems in Graph Coloring and Graph Structure

Abstract

dc:description

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 .

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kim, Seog-Jin
Contributors dc:contributor
  • West, Douglas B.

Subjects

dc:subject × 1

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
(MiAaPQ)AAI3111558
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/86826

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Kim, Seog-Jin. Problems in Graph Coloring and Graph Structure. Dissertation thesis, University of Illinois at Urbana-Champaign, 2015. http://hdl.handle.net/2142/86826