Packing three copies of a tree into a complete bipartite graph
type: Item
instance of: scholarly article
title: Packing three copies of a tree into a complete bipartite graph
zbMATH Open document ID: 1229.05233
author: Hong Wang
published in: Annals of Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5999906
zbMATH Keywords: packing
zbMATH Keywords: bipartite packing
zbMATH Keywords: embedding
MaRDI profile type: Publication
full work available at URL: s00026-009-0022-0
OpenAlex ID: W2007468761
cites work: Mutual placement of bipartite graphs
cites work: Packing trees in complete graphs
cites work: Packing two forests into a bipartite graph
cites work: Q5689003
cites work: Packing of graphs and permutations -- a survey
cites work: Packing of graphs - a survey
DOI: 10.1007/S00026-009-0022-0
description: scientific article; zbMATH DE number 5999906