Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Darryn E. Bryant / rank | |||
Normal rank | |||
| Property / review text | |||
Summary: It is shown that if \(G\) is any bipartite 2-regular graph of order at most \(n/2\) or at least \(n-2\), then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order \(n\) into a perfect matching and edge-disjoint copies of \(G\). | |||
| Property / review text: Summary: It is shown that if \(G\) is any bipartite 2-regular graph of order at most \(n/2\) or at least \(n-2\), then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order \(n\) into a perfect matching and edge-disjoint copies of \(G\). / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C51 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05B30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6579076 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph decompositions | |||
| Property / zbMATH Keywords: graph decompositions / rank | |||
Normal rank | |||
Revision as of 17:41, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of complete graphs into bipartite 2-regular subgraphs |
scientific article |
Statements
Decompositions of complete graphs into bipartite 2-regular subgraphs (English)
0 references
11 May 2016
0 references
Summary: It is shown that if \(G\) is any bipartite 2-regular graph of order at most \(n/2\) or at least \(n-2\), then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order \(n\) into a perfect matching and edge-disjoint copies of \(G\).
0 references
graph decompositions
0 references
