Files in this item

FilesDescriptionFormat

application/pdf

application/pdf9990029.pdf (6MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Structural and Extremal Problems in Graph Theory
Author(s):Jiang, Tao
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:A 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.).
Issue Date:2000
Type:Text
Language:English
Description:134 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.
URI:http://hdl.handle.net/2142/87002
Other Identifier(s):(MiAaPQ)AAI9990029
Date Available in IDEALS:2015-09-28
Date Deposited:2000


This item appears in the following Collection(s)

Item Statistics