Volume 47,
December 1997
- Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23.
- Daphne Der-Fen Liu, Roger K. Yeh:
On Distance Two Labellings of Graphs.
- Alfred Menezes, Yi-Hong Wu:
The Discrete Logarithm Problem in GL(n, q).
- Wai Chee Shiu:
Decoding DeBruijn Arrays Constructed by the FMSS Method.
- T. K. Dutta, B. K. Roy:
Construction of Symmetric Balanced Squares.
- Masaaki Harada:
Weighing Matrics and Self-Dual Codes.
- Charlie H. Cooke:
Several Resolvable BIB or PBIB Doubles Round Robin Tournament Designs.
- Wai Chee Shiu, Y. P. Tang:
Existence of Ideal matrices.
- Mordechai Lewin:
A Note Following a Remark of Harary Regarding a Certain Family of Sum Graphs.
- Bert Hartnell, Carol Whitehead:
On k-packings of graphs.
- John G. Gimbel, Michael A. Henning, Zsolt Tuza:
Switching Distance Graphs.
- Ping Wang:
An Upper Bound for the (n, 5)-cages.
- Peter Horák, Alexander Rosa, Jozef Sirán:
Maximal Orthogonal Latin Rectangles.
- Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan:
On Bandwidth and Cyclic Bandwidth of Graphs.
- Brian Peterson, Linda Valdes:
Derangements in Sylow Subgroups of Symmetric Groups.
- J. Richard Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen:
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs.
- Stefan Heiss:
A Note on the P3-Sequenceability of Finite Groups.
- George Steiner:
A poset-based method for counting partitions and Ferrers diagrams.
- Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer:
Local connectivity and cycle xtension in claw-free graphs.
- Claudio L. Lucchesi, Maria Cecilia M. T. Giglio:
On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem.
- Zhike Jiang:
On Rotational Steiner Triple Systems: Five, Seven and Eleven.
- C. Christofi:
On the Number of 6 4 7 Double Youden Rectangles.
- Bu Yue Hua, Zhang Ke Min:
On the Arc-Pancyclicity of Local Tournaments.
- Serge Lawrencenko, Jingzhong Mao:
A Sharp Lower Bound for the Number of Connectivity-Redundant Nodes.
- Ramesh S. Sankaranarayana:
A generalization of Favaron's theorem.
- Yanxun Chang:
A construction of holey perfect Mendelsohn designs.
- Krzysztof Giaro:
The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard.
- David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley:
P3-Connected Graphs of Minimum Size.
- Ruqun Shen, Feng Tian, Bing Wei:
Hamiltonicity of k-connected graphs with independent claws.
- Christian Bey:
On incidence matrices of finite affine geometries.
Copyright © Thu Dec 10 20:18:40 2009
by Michael Ley (ley@uni-trier.de)
