2026-09-20T19:16:52Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/86849 2023-07-11 col_2142_5131 col_2142_16340 com_2142_5130 com_2142_16339 com_2142_8903

Kostochka, Alexandr Nakprasit, Kittikorn 2015-09-28T15:19:50Z 2015-09-28T15:19:50Z 10000-01-01 2004 2004 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. Made available in DSpace on 2015-09-28T15:19:50Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3160931.pdf: 5623230 bytes, checksum: d6688d4663d607e572a69a178db62d96 (MD5) Previous issue date: 2004 Embargo set by: Seth Robbins for item 88130 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 121 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004. http://hdl.handle.net/2142/86849 (MiAaPQ)AAI3160931 eng Mathematics Coloring and Packing Problems for D-Degenerate Graphs text Mathematics Mathematics University of Illinois at Urbana-Champaign Dissertation Ph.D.