1. (2n, 2n, 2n, 1)‐Relative Difference Sets and Their Representations. Issue 12 (16th April 2013) Authors: Zhou, Yue Journal: Journal of combinatorial designs Issue: Volume 21:Issue 12(2013:Dec.) Page Start: 563 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs. (18th October 2013) Authors: KITTIPASSORN, TEERADEJ; NARAYANAN, BHARGAV P. Journal: Combinatorics, probability and computing Issue: Volume 23:Number 1(2014:Jan.) Page Start: 102 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A Construction of Almost Steiner Systems. Issue 11 (10th November 2013) Authors: Ferber, Asaf; Hod, Rani; Krivelevich, Michael; Sudakov, Benny Journal: Journal of combinatorial designs Issue: Volume 22:Issue 11(2014:Nov.) Page Start: 488 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A Marstrand Theorem for Subsets of Integers. (25th October 2013) Authors: LIMA, YURI; MOREIRA, CARLOS GUSTAVO Journal: Combinatorics, probability and computing Issue: Volume 23:Number 1(2014:Jan.) Page Start: 116 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. A Partition of the Hypercube into Maximally Nonparallel Hamming Codes. Issue 4 (8th July 2013) Authors: Krotov, Denis S. Journal: Journal of combinatorial designs Issue: Volume 22:Issue 4(2014:Apr.) Page Start: 179 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. A Polynomial Representation and a Unique Code of a Simple Undirected Graph. (27th August 2013) Authors: Ghosh, Shamik; Sen Gupta, Raibatak; Sen, M. K. Other Names: Bannai E. Academic Editor.; Clark L. Academic Editor.; Kim D. S. Academic Editor. Journal: ISRN combinatorics Issue: Volume 2013(2013) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Almost Every Tree With m Edges Decomposes K2m, 2m. (3rd December 2013) Authors: DRMOTA, M.; LLADÓ, A. Journal: Combinatorics, probability and computing Issue: Volume 23:Number 1(2014:Jan.) Page Start: 50 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Almost Every Tree With m Edges Decomposes K2m, 2m. (3rd December 2013) Authors: DRMOTA, M.; LLADÓ, A. Journal: Combinatorics, probability and computing Issue: Volume 23:Number 1(2014:Jan.) Page Start: 50 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Applications of a New Separator Theorem for String Graphs. (25th October 2013) Authors: FOX, JACOB; PACH, JÁNOS Journal: Combinatorics, probability and computing Issue: Volume 23:Number 1(2014:Jan.) Page Start: 66 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Bounds and Constructions for Two‐Dimensional Variable‐Weight Optical Orthogonal Codes. Issue 9 (12th June 2013) Authors: Cheng, Minquan; Jiang, Jing; Wu, Dianhua Journal: Journal of combinatorial designs Issue: Volume 22:Issue 9(2014:Sep.) Page Start: 391 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗