Files in this item

FilesDescriptionFormat

application/pdf

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

Description

Title:Coloring and Packing Problems for D-Degenerate Graphs
Author(s):Nakprasit, Kittikorn
Doctoral Committee Chair(s):Kostochka, Alexandr
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:Then, we consider packing problems for d-degenerate graphs. Two graphs G1 and G 2 pack if G1 is a subgraph of the complement G¯2 of G 2. We disprove one of the conjecture of Bollobas and Eldridge and prove an extension of their other conjecture. We also show that other than maximum degrees, degeneracy of graphs is also important in packing.
Issue Date:2004
Type:Text
Language:English
Description:121 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.
URI:http://hdl.handle.net/2142/86849
Other Identifier(s):(MiAaPQ)AAI3160931
Date Available in IDEALS:2015-09-28
Date Deposited:2004


This item appears in the following Collection(s)

Item Statistics