Covering and packing problems on graphs and hypergraphs

Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:22Z Item was in collections: University of Illinois Dissertations and Theses (ID: 204) Dissertations and Theses - Mathematics (ID: 749) No. of bitstreams: 3 Stocker_Christopher.pdf.txt: 236192 bytes, checksum: 067aec962de966b7818554c3e64234fc (MD5) Stocker_Christopher.pdf: 852506 bytes, checksum: 530f1620c6322cdfe53823e824659eef (MD5) license.txt: 4069 bytes, checksum: 218bcf9c0919af1e589f3a2350554a51 (MD5)

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

2011

Author dc:creator

• Stocker, Christopher J.

Contributors dc:contributor

• Kostochka, Alexandr V.
• West, Douglas B.
• Furedi, Zoltan
• Balogh, József

• Packing
• Domination
• Acyclic Coloring

Statement dc:rights

• Copyright 2011 Christopher J. Stocker

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/26316

OAI identifier oai:identifier

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