Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: tree packing

Sortuj według:

Ogranicz wyniki do:

Packing Trees Into n-Chromatic Graphs

100%

Gyárfás A.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 1

199-201

We show that if a sequence of trees T1, T2, ..., Tn−1 can be packed into Kn then they can be also packed into any n-chromatic graph.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Generalizations of the tree packing conjecture

63%

Gerbner D., Keszegh B., Palmer C.

Discussiones Mathematicae Graph Theory

2012

tom 32

nr 3

569-582

The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (edge-disjoint) packing into the complete graph on k vertices. Gyárfás and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into k-chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any k-chromatic graph. We also consider several other generalizations of the conjecture.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Gerbner D.

1 Gyárfás A.

1 Keszegh B.

1 Palmer C.

1 2014

1 2012

Wyniki wyszukiwania

Packing Trees Into n-Chromatic Graphs

Generalizations of the tree packing conjecture