Volume 60 (2014)

  • Part 1

  • Mark Ramras
    • Congestion-free routing of linear permutations on Fibonacci and Lucas cubes, p.1
    • Download Full Text (114Kb pdf)
  • Gary MacGillivray and Kailyn M. Sherk
  • Derrick Stolee
    • Automorphism groups and adversarial vertex deletions, p.27
    • Download Full Text (166Kb pdf)
  • Caroline Shapcott
  • P. Ali, S. Mukwembi and S. Munyira
  • Peter Borg
    • The maximum product of sizes of cross-$t$-intersecting uniform families, p.69
    • Download Full Text (112Kb pdf)
  • Sarada Herke
    • On the perfect 1-factorisation problem for circulant graphs of degree 4, p.79
    • Download Full Text (631Kb pdf)
  • Part 2

  • Roland Bacher
  • Patrick Bahls, Elizabeth Bailey and McCabe Olsen
    • New families of graphs whose independence polynomials have only real roots, p.128
    • Download Full Text (98Kb pdf)
  • J. Louis Sewell and Peter J. Slater
    • A sharp lower bound for locating-dominating sets in trees, p.136
    • Download Full Text (144Kb pdf)
  • Tatsuya Maruta, Taichiro Tanaka and Hitoshi Kanda
    • Some generalizations of extension theorems for linear codes over finite fields, p.150
    • Download Full Text (108Kb pdf)
  • Ruixia Wang
  • K. Asciak, J. Lauri, W. Myrvold and V. Pannone
  • James A. Sellers
    • Elementary proofs of congruences for the cubic and overcubic partition functions, p.191
    • Download Full Text (74Kb pdf)
  • Alessandro Conflitti, Ricardo Mamede and Eleni Tzanaki
    • Dominant Shi regions with a fixed separating wall: bijective enumeration, p.198
    • Download Full Text (273Kb pdf)
  • Antonio Cossidente and Angelo Sonnino
    • On graphs and codes associated to the sporadic simple groups HS and $M_{22}$, p.208
    • Download Full Text (95Kb pdf)
  • Grant Cairns, Stacey Mendan and Yuri Nikolayevsky
    • A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences, p.217
    • Download Full Text (102Kb pdf)
  • Darryn Bryant, Sarada Herke, Barbara Maenhaut and Wannasiri Wannasit
    • Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs, p.227
    • Download Full Text (209Kb pdf)
  • Part 3

  • Udaya Parampalli and Serdar Boztaş
  • P. Katerinis
    • Minimum degree and the existence of semiregular factors in planar graphs, p.263
    • Download Full Text (124Kb pdf)
  • Jeremy F. Alm and Jacob Manske
  • Matthieu Josuat-Vergès
    • Enumeration of snakes and cycle-alternating permutations, p.279
    • Download Full Text (250Kb pdf)
  • Xueliang Li, Yuefang Sun and Yan Zhao
    • Characterize graphs with rainbow connection numbers $m-2$ and $m-3$, p.306
    • Download Full Text (105Kb pdf)
  • Lowell Abrams and Yosef Berman
    • Connected pseudoachromatic index of complete graphs, p.314
    • Download Full Text (205Kb pdf)
  • Mario Gionfriddo and Salvatore Milici
    • Uniformly resolvable ${\cal H}$-designs with ${\cal H}=\{P_3,P_4\}$, p.325
    • Download Full Text (97Kb pdf)
  • Richard A. Brualdi and Hwa Kyung Kim