Table of Contents
Research Papers
| Bent Hamilton Cycles in $d$-Dimensional Grid Graphs | |
| F. Ruskey, Joe Sawada | R1 |
| Optimal Double-Loop Networks with Non-Unit Steps | |
| F. Aguiló, E. Simó, M. Zaragozá | R2 |
| The Cube Polynomial and its Derivatives: the Case of Median Graphs | |
| Boštjan Brešar, Sandi Klavžar, Riste Škrekovski | R3 |
| Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice | |
| N. Calkin, C. Merino, S. Noble, M. Noy | R4 |
| Nowhere-Zero 3-Flows in Squares of Graphs | |
| Rui Xu, Cun-Quan Zhang | R5 |
| Colouring the Petals of a Graph | |
| David Cariolaro, Gianfranco Cariolaro | R6 |
| On the Identification of Vertices Using Cycles | |
| Petri Rosendahl | R7 |
| Packing 10 or 11 Unit Squares in a Square | |
| Walter Stromquist | R8 |
| A $p,q$-analogue of a Formula of Frobenius | |
| Karen S. Briggs, Jeffrey B. Remmel | R9 |
| Inversion of Bilateral Basic Hypergeometric Series | |
| Michael Schlosser | R10 |
| On $k$-Ordered Bipartite Graphs | |
| Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf | R11 |
| How Many Square Occurrences Must a Binary Sequence Contain? | |
| Gregory Kucherov, Pascal Ochem, Michaël Rao | R12 |
| Finite Rogers-Ramanujan Type Identities | |
| Andrew V. Sills | R13 |
| An Apéry-like Difference Equation for Catalan's Constant | |
| W. Zudilin | R14 |
| A Discontinuity in the Distribution of Fixed Point Sums | |
| Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf | R15 |
| A Schröder Generalization of Haglund's Statistic on Catalan Paths | |
| E. S. Egge, J. Haglund, K. Killpatrick, D. Kremer | R16 |
| Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices | |
| L. K. Jørgensen, M. Klin | R17 |
| The Turán Density of the Hypergraph $\{abc,ade,bde,cde\}$ | |
| Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits | R18 |
| A New Class of q-Fibonacci Polynomials | |
| Johann Cigler | R19 |
| The Neighborhood Characteristic Parameter for Graphs | |
| Terry A. McKee | R20 |
| Two-Stage Allocations and the Double $Q$-Function | |
| Sergey Agievich | R21 |
| Translational Tilings of the Integers with Long Periods | |
| Mihail N. Kolountzakis | R22 |
| Coding Parking Functions by Pairs of Permutations | |
| Yurii Burman, Michael Shapiro | R23 |
| Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic Arrays | |
| E. Strahov | R24 |
| On Hypergraphs of Girth Five | |
| Felix Lazebnik, Jacques Verstraëte | R25 |
| Short Cycles in Digraphs with Local Average Outdegree at Least Two | |
| Jian Shen | R26 |
| Binary Gray Codes with Long Bit Runs | |
| Luis Goddyn, Pavol Gvozdjak | R27 |
| Monochrome Symmetric Subsets in 2-Colorings of Groups | |
| Yuliya Gryshko | R28 |
| On Randomly Generated Intersecting Hypergraphs | |
| Tom Bohman, Colin Cooper, Alan Frieze, Ryan Martin, Miklós Ruszinkó | R29 |
| Homotopy and Homology of Finite Lattices | |
| Andreas Blass | R30 |
| Some Non-Normal Cayley Digraphs of the Generalized Quaternion Group of Certain Orders | |
| Edward Dobson | R31 |
| The Order of Monochromatic Subgraphs with a Given Minimum Degree | |
| Yair Caro, Raphael Yuster | R32 |
| Bounds for DNA Codes with Constant GC-Content | |
| Oliver D. King | R33 |
| The $q$-Binomial Theorem and two Symmetric $q$-Identities | |
| Victor J. W. Guo | R34 |
| Bicoloured Dyck Paths and the Contact Polynomial for $n$ Non-Intersecting Paths in a Half-Plane Lattice | |
| R. Brak, J. W. Essam | R35 |
| Short Generating Functions for some Semigroup Algebras | |
| Graham Denham | R36 |
| Permutation Separations and Complete Bipartite Factorisations of $K_{n,n}$ | |
| Nigel Martin, Richard Stong | R37 |
| Skolem-type Difference Sets for Cycle Systems | |
| Darryn Bryant, Heather Gavlas, Alan C. H. Ling | R38 |
| Matrix-Free Proof of a Regularity Characterization | |
| A. Czygrinow, B. Nagle | R39 |
| Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls | |
| Edward A. Bender, William J. Helton, L. Bruce Richmond | R40 |
| The Restricted Arc-Width of a Graph | |
| David Arthur | R41 |
| On a Two-Sided Turán Problem | |
| Dhruv Mubayi, Yi Zhao | R42 |
| Path Counting and Random Matrix Theory | |
| Ioana Dumitriu, Etienne Rassart | R43 |
| Correspondence between two Antimatroid Algorithmic Characterizations | |
| Yulia Kempner, Vadim E. Levit | R44 |
| Even Circuits of Prescribed Clockwise Parity | |
| Ilse Fischer, C. H. C. Little | R45 |
| Finding Induced Acyclic Subgraphs in Random Digraphs | |
| C. R. Subramanian | R46 |
| Global Defensive Alliances in Graphs | |
| Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning | R47 |
Notes
| A Note on Graph Coloring Extensions and List-Colorings | |
| Maria Axenovich | N1 |
| A Note on the Edge-Connectivity of Cages | |
| Ping Wang, Baoguang Xu, Jianfang Wang | N2 |
| Regular Character Tables of Symmetric Groups | |
| Jorn B. Olsson | N3 |
| Dynamic One-Pile Blocking Nim | |
| Achim Flammenkamp, Arthur Holshouser, Harold Reiter | N4 |
| Self-Describing Sequences and the Catalan Family Tree | |
| Zoran Šuniƙ | N5 |
| Some Remarks on the Plotkin Bound | |
| Jörn Quistorff | N6 |
| One Pile Nim with Arbitrary Move Function | |
| Arthur Holshouser, Harold Reiter | N7 |
| On the Crossing Number of $K_{m,n}$ | |
| Nagi H. Nahas | N8 |
| Domination, Packing and Excluded Minors | |
| Thomas Böhme, Bojan Mohar | N9 |
| On Hypergraphs with Every Four Points Spanning at Most Two Triples | |
| Dhruv Mubayi | N10 |
| The Rank of a Cograph | |
| Gordon F. Royle | N11 |
| Forestation in Hypergraphs: Linear $k$-Trees | |
| Ojas Parekh | N12 |
| Descents in Noncrossing Trees | |
| David S. Hough | N13 |
ISSN: 1077-8926