View in ORKGAbstract
121 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 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.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD