Packing four copies of a tree into a complete bipartite graph
type: Item
instance of: scholarly article
title: Packing four copies of a tree into a complete bipartite graph
DOI: 10.21136/CMJ.2021.0249-20
author: Liqun Pu
author: Yuan Tang
author: Xiaoli Gao
published in: Czechoslovak Mathematical Journal
publication date: 2022-04-22T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7511552
zbMATH Keywords: packing
zbMATH Keywords: bipartite packing
zbMATH Keywords: embedding
MaRDI profile type: MaRDI publication profile
cites work: Mutual placement of bipartite graphs
cites work: Packing trees in complete graphs
cites work: Packing two forests into a bipartite graph
full work available at URL: cmj.2021.0249-20
OpenAlex ID: W4200113046
Recommended article: Packing four copies of a tree into a complete graph
Recommended article: Packing three copies of a tree into a complete bipartite graph
Recommended article: Packing trees into complete bipartite graphs
Recommended article: On packing trees into complete bipartite graphs
Recommended article: Packing trees in complete bipartite graphs
Recommended article: Packing three copies of a tree into a complete graph
Recommended article: Packing two copies of a tree into its fourth power
Recommended article: Q5074393
Recommended article: Packing complete multipartite graphs with 4-cycles
Recommended article: Packing Trees into the Complete Graph
description: scientific article; zbMATH DE number 7511552