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

DOI10.2307/2043138zbMath0404.05039OpenAlexW4245730409MaRDI QIDQ4189308

Paul J. Schillo, H. Joseph Straight

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) Elementary theory of partitions (11P81) Graph theory (05C99)

Related Items (4)

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

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