A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (Q1078203): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1171577 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: John Mitchem / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3743338 / rank | |||
Normal rank | |||
Latest revision as of 13:57, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components |
scientific article |
Statements
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (English)
0 references
1986
0 references
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\).
0 references
edge partition
0 references
complete bipartite graph
0 references
star
0 references
partition
0 references
