University of Illinois Urbana-Champaign

Coloring and Packing Problems for D-Degenerate Graphs

Nakprasit, Kittikorn

This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.

Permalink

https://hdl.handle.net/2142/86849

Description

Title
Coloring and Packing Problems for D-Degenerate Graphs
Author(s)
Nakprasit, Kittikorn
Issue Date
2004
Doctoral Committee Chair(s)
Kostochka, Alexandr
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Mathematics
Language
eng
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.
Graduation Semester
2004
Type of Resource
text
Permalink
http://hdl.handle.net/2142/86849

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Mathematics