scientific article; zbMATH DE number 1556758
From MaRDI portal
Publication:4526648
Recommendations
- On decomposing complete tripartite graphs into 5-cycles
- Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
- The problem of decomposing a complete tripartite graph into 5-cycles
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
Cited in
(18)- Sparse graphs which decompose into closed trails of arbitrary lengths
- Further decompositions of complete tripartite graphs into 5-cycles
- A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
- \(C_7\)-decompositions of the tensor product of complete graphs
- \(C_{p}\)-decompositions of some regular graphs
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
- Equipartite gregarious 5-cycle systems and other results
- Some equitably 3-colourable cycle decompositions of complete equipartite graphs
- On Eulerian regular complete 5-partite graphs and a cycle decomposition problem
- The problem of decomposing a complete tripartite graph into 5-cycles
- On decomposing complete tripartite graphs into 5-cycles
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths
- 3,5-Cycle decompositions
- Decomposition of complete tripartite graphs into cycles and paths of length three
- Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
- Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
- Decomposition of complete Tripartite graphs into triangles and claws
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526648)
