Back to results
University of Illinois at Urbana-Champaign
Structural and Extremal Problems in Graph Theory
Abstract
dc:descriptionA mixed hypergraph H designates its edges as type C or D (or both). A strict k-coloring of H is a surjection c : X → {1,..., k} such that each C -edge has two vertices with common color and each D -edge has two vertices with distinct color. The feasible set of H is {k : H has a strict k-coloring}. (Abstract shortened by UMI.).
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
-
- Jiang, Tao
- Contributors dc:contributor
-
- West, Douglas B.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI9990029
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/87002