Path and cycle decompositions of complete equipartite graphs: Four parts (Q1025923): 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.disc.2008.08.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030740204 / rank | |||
Normal rank |
Revision as of 00:58, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Path and cycle decompositions of complete equipartite graphs: Four parts |
scientific article |
Statements
Path and cycle decompositions of complete equipartite graphs: Four parts (English)
0 references
23 June 2009
0 references
It is proved that a complete equipartite graph with four partite sets of size \(m\) has an edge-disjoint decomposition into cycles of length \(k\) if and only if \(k\geq 3\), \(m\) is even, \(k\) divides \(6m^2\) and \(k\leq 4m\). It is also proved that a complete equipartite graph with four partite sets of an even size \(m\) has an edge-disjoint decomposition into paths of length \(k\) if and only if \(k\) divides \(6m^2\) and \(k<4m\).
0 references
complete equipartite graph
0 references
path decomposition
0 references
cycle decomposition
0 references