Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

Generalizations of the tree packing conjecture

100%

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.

Additive properties of a pair of sequences

76%

Benevides F., Hulgan J., Lemons N., Palmer C., Riet A.-E., Wheeler J.

Acta Arithmetica

2009

tom 139

nr 2

185-197

Ograniczanie wyników

1 Acta Arithmetica

1 Discussiones Mathematicae Graph Theory

2 Palmer C.

1 Benevides F.

1 Gerbner D.

1 Hulgan J.

1 Keszegh B.

1 Lemons N.

1 Riet A.-E.

1 Wheeler J.

1 2012

1 2009

Wyniki wyszukiwania

Generalizations of the tree packing conjecture

Additive properties of a pair of sequences