Coloring and Packing Problems for D-Degenerate Graphs

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.

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 dc:creator

• Nakprasit, Kittikorn

Contributors dc:contributor

• Kostochka, Alexandr

• Mathematics

Language dc:language

eng

Identifier

(MiAaPQ)AAI3160931

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/86849