On the existence of balanced chain rule task sets

DOI10.61091/JCMCC127-09MaRDI QIDQ6920997zbMATH OpenFDO

Authors

Publication date 6 October 2025

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC127-09

zbMATH Keywords

combinatorial designsgraph decompositions

Mathematics Subject Classification ID

Other designs, configurations (05B30) Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90)

Cites work

• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of the complete directed graph into k-circuits
• Decompositions of a complete multidigraph into nonhamiltonian paths
• Directed star decompositions of the complete directed graph
• scientific article; zbMATH DE number 47528 (Why is no real title available?)
• scientific article; zbMATH DE number 3596873 (Why is no real title available?)

This page was built for publication: On the existence of balanced chain rule task sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920997)