A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
type: Item
instance of: scholarly article
title: A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
zbMATH Open document ID: 0596.05050
DOI: 10.1016/0012-365X(86)90190-1
author: Yoshimi Egawa
author: Masatsugu Urabe
author: Toshihito Fukuda
author: Seiichiro Nagoya
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
review text: The complete bipartite graph \(k_{1,m}\), \(m\geq 1\), is called a star. In this note it is shown, for \(n\geq 4\), that the minimum number of star- subgraphs which partition the edges of \(k_{2n-1,2n-1}\) or \(k_{2n,2n}\) is \(n+2\).
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3959479
zbMATH Keywords: edge partition
zbMATH Keywords: complete bipartite graph
zbMATH Keywords: star
zbMATH Keywords: partition
reviewed by: John Mitchem
MaRDI profile type: Publication
cites work: Q3743338
Recommended article: Decomposition of complete bipartite graphs into paths and stars with same number of edges
Recommended article: Decomposition of the complete bipartite multigraph into cycles and stars
Recommended article: Q5397239
Recommended article: Decomposition of balanced complete bipartite multigraphs into multistars
Recommended article: Q3312268
Recommended article: Q3120648
Recommended article: On bipartite graphs with complete bipartite star complements
Recommended article: Q4208425
Recommended article: Decomposition of complete bipartite graphs into cycles and stars with four edges
Recommended article: Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
description: scientific article; zbMATH DE number 3959479