On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums

DOI10.2307/2043138MaRDI QIDQ4189308zbMATH OpenOpenAlexFDO

Authors H. Joseph Straight, Paul J. Schillo

Publication date 1979

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2043138

zbMATH Keywords

PartitionPath-Perfect Graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Elementary theory of partitions (11P81)

Cited in

(4)

• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• A note on path-perfect graphs
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
• An approximation algorithm for the cutting-sticks problem

This page was built for publication: On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums

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