On Eulerian regular complete 5-partite graphs and a cycle decomposition problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1556758
- On decomposing complete tripartite graphs into 5-cycles
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- On the Eulerian cycle decomposition conjecture and complete multipartite graphs
- The problem of decomposing a complete tripartite graph into 5-cycles
- Further decompositions of complete tripartite graphs into 5-cycles
- Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
- Decomposing complete equipartite graphs into connected unicyclic graphs of size five
- Decompositions of graphs into 5-cycles and other small graphs
- A cycle decomposition conjecture for Eulerian graphs
Cited in
(9)- Further decompositions of complete tripartite graphs into 5-cycles
- Eulerian cycle decomposition conjecture for the line graph of complete graphs
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
- Equipartite gregarious 5-cycle systems and other results
- On the Eulerian cycle decomposition conjecture and complete multipartite graphs
- scientific article; zbMATH DE number 5954411 (Why is no real title available?)
- scientific article; zbMATH DE number 6867904 (Why is no real title available?)
- Cycle decompositions and constructive characterizations
- From edge colorings to graph decompositions -- results and problems
This page was built for publication: On Eulerian regular complete 5-partite graphs and a cycle decomposition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2791964)
