Large sets of Hamilton cycle decompositions of complete bipartite graphs (Q932831): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046459135 / rank | |||
Normal rank | |||
Revision as of 01:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Large sets of Hamilton cycle decompositions of complete bipartite graphs |
scientific article |
Statements
Large sets of Hamilton cycle decompositions of complete bipartite graphs (English)
0 references
11 July 2008
0 references
Let \(K_{p,p}\) be the complete bipartite graph with \(p\) vertices in each partite set. The authors prove that there exist a large set of Hamilton cycle decomposition of \(K_{2t,2t}\) and a large Hamilton cycle decomposition of \(K_{2t+1,2t+1}-I\), where \(I\) is a perfect matching.
0 references
Hamilton cycle decomposition
0 references
Complete bipartite graph
0 references
