Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles (Q1399917): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of the complete directed graph into k-circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian decomposition of Cayley graphs of degree 4 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the construction of odd cycle systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycle decompositions III: Complete graphs and fixed length cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank | |||
Normal rank | |||
Latest revision as of 17:54, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles |
scientific article |
Statements
Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles (English)
0 references
30 July 2003
0 references
The authors settle completely the problem of decomposing the complete symmetric digraph of order \(n\), \(K_n*\). They show that for any positive integers \(m\) and \(n\) (\(2 \leq m \leq n\)), \(K_n*\) can be decomposed into directed cycles of length \(m\) if and only if \(m\) divides the number of arcs in \(K_n*\) and \((n,m) \not= (4,4), (6,3),(6,6)\). The careful reader will appreciate the (40 pages of) detail given to the cycle constructions. The use of circulant graphs somewhat enlivens the discussion.
0 references
