Packing trees in complete bipartite graphs
type: Item
instance of: scholarly article
title: Packing trees in complete bipartite graphs
zbMATH Open document ID: 1479.05306
author: Jieyan Wang
publication date: 2022-01-03T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 7451252
zbMATH Keywords: packing
zbMATH Keywords: placement
zbMATH Keywords: edge-disjoint tree
zbMATH Keywords: bipartite graph
MaRDI profile type: Publication
full work available at URL: dmgt.2252
OpenAlex ID: W2987204348
cites work: Embedding (p,p - 1) graphs in their complements
cites work: Q4170743
cites work: Packing four copies of a tree into a complete graph
cites work: 2-placement of (p,q)-trees
cites work: Packing three copies of a tree into a complete graph
cites work: Packing two forests into a bipartite graph
cites work: Packing three copies of a tree into a complete bipartite graph
cites work: Packing of graphs and permutations -- a survey
cites work: Packing of graphs - a survey
DOI: 10.7151/DMGT.2252
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7451252