- Tytuł:
- Packing Trees in Complete Bipartite Graphs
- Autorzy:
- Wang, Jieyan
- Powiązania:
- https://bibliotekanauki.pl/articles/32361740.pdf
- Data publikacji:
- 2022-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
packing
placement
edge-disjoint tree
bipartite graph - Opis:
- An embedding of a graph H in a graph G is an injection (i.e., a one-to-one function) σ from the vertices of H to the vertices of G such that σ(x)σ(y) is an edge of G for all edges xy of H. The image of H in G under σ is denoted by σ(H). A k-packing of a graph H in a graph G is a sequence (σ1, σ2,…, σk) of embeddings of H in G such that σ1(H), σ2(H),…, σk(H) are edge disjoint. We prove that for any tree T of order n, there is a 4-packing of T in a complete bipartite graph of order at most n+12.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2022, 42, 1; 263-275
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł