Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

JCT
2008

favoriteEmaildiscussreport

79views more JCT 2008»

Packing d-degenerate graphs

13 years 4 months ago

Packing d-degenerate graphs

Download www.math.uiuc.edu

We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob

Béla Bollobás, Alexandr V. Kostochka

Real-time Traffic

Bollob´asEldridgeCatlin Conjecture | JCT 2008 | Maximal Degree | Stronger Form |

claim paper

Related Content

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Packing multiway cuts in capacitated graphs

» On Packing Colorings of Distance Graphs

» Jamming and Geometric Representations of Graphs

» Multidimensional Packing with Conflicts

» ContextFree Grammar Rewriting and the Transfer of Packed Linguistic Representations

» A Parameterized Perspective on Packing Paths of Length Two

» Packing 5cycles into balanced complete m partite graphs for odd m

» Packing triangles in low degree graphs and indifference graphs

» Combinatorial and computational aspects of graph packing and graph decomposition

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCT
Authors	Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit

Comments (0)