[BCC-Logo]

List C

Recent and forthcoming publications

This list contains combinatorial books and papers that have been published, accepted or submitted for publication since the last issue of the Bulletin. This should not be taken as a complete record of all such publications for the period, and absence of listed publications for any individual should not be taken to imply absence of research activity.

A | B | C | D | E | F | G | H | I | J | K | L | M | N | | P | Q | R | S | | U | V | W | | |

 

A

Alabdullatif, M. and Walker K.
Maximum graphs not spannable by r disjoint paths, Discrete Mathematics, to appear
 
Allen, S.M., Hurley, S. Smith, D.H. and Thiel, S.U.
Using lower bounds in minimum span frequency assignment, Proceeding of 2nd International Conference on Metaheuristics, (MIC 97), to appear
 
Allen, S.M., Hurley, S. Smith, D.H. and Watkins, W.J.
Solving Frequency Assignment Problems, Proceedings of 14th International Wroclaw Symposium of Electromagnetic Compability, (1998), pp.703-704
 
Allen, S.M., Hurley, S. and Smith, D.H.
Lower bounding techniques for frequency assignment, Discrete Mathematics, to appear
 
Anderson, I.
On the construction of balanced Room Squares, Discrete Maths, to appear
 
Balancing carry-over effects in tournaments, Combinatorial Designs and their Applications, (Holroyd, F.C., Quinn, K.A.S., Rowley, C.A. and Webb, B.S. eds.), CRC Press Research Notes, to appear
 
Anderson, I., Finizio, N.J.
On the construction of triplewhist tournaments, to appear
 
Anderson, I., Finizio, N.J., Leonard, P.A.
New product theorems for whist tournaments, J. Combinational Theory, A., to appear
 
Anderson, I., Griggs, T.S.
Anstice and Kirkman: mathematical clerics, Mathematical Intelligencer, to appear
 
Anthony, M.
Probabilistic 'generalisation' of functions and dimension-based uniform convergence results, Statistics and Computing, submitted
 
Anthony, M. and Bartlett, P.
Neural Network Learning: Theoretical Foundations, Cambridge University Press, 1999, to be published
 
Anthony, M., Bartlett, Shawe-Taylor and Williamson, R.C.
Structural Risk minimisation over data-dependent hierachies, IEEE Transactions on Information Theory
 
Accuracy of techniques for the logical analysis of data, Discrete Applied Mathematics, to appear
 
Anthony, M. and Holden, S.B.
Cross-validation for binary classification by real-valued functions, in Proceedings of the 1998 Annual Workshop on Computational Learning Theory, Madison, Wisconsin, (1998), ACM Press
 
Araujo, I. and Ruskuc, N.
On finite presentability of direct products of semigroups, submitted
 
Arrowsmith, D.K. and Essam, J.W.
Chromatic Polynomials and mod-q flows on directed graphs and their applications, submitted
 
 
Atkinson, M.D.
Permutations which are the union of an increasing and decreasing sequence, Electronic J. Combinatorics, No. 5 (1998), Paper R6, p.13
 
Restricted Permutations, Discrete Mathematics, to appear
 
Ayik, H. Campbell, C.M., O'Connor, J.J. and Ruskuc, N.
On the efficiency of finite simple semigroups, submitted
 
The semigroup efficiency of groups, submitted
 
Azais, J.-M., Monod, H. and Bailey, R.A.
The influence of designs on validity and efficiancy of neighbour methods, Biometrics, in press
 

B

Babai, L. and Cameron P.J.
Automorphisms and enumeration of switching classes of tournaments, in preparation
 
Bailey, R.A.
Statistics and Mathematics: the appropriate use of Mathematics within statistics, The Statistician, No 47, (1998), pp. 261-271
 
Resolved designs viewed as sets of partitions, in Combinatorial Design and their Applications, (Holroyd, F.C., Quinn, K.A.S., Rowley, C.A., Webb, B.S. (eds.)), Chapman & Hall/ CRC Press, Research notes in Mathematics, CRC Press LLC, Boca Raton
 
Four families of efficient resolvable designs in three replicates, in preparation
 
Bailey, R.A. and Monod, H.
Efficient semi-latin rectangles: designs for plant disease experiments, in preparation
 
Bang-Jensen, J. and Gutin, G.
Generalisations of tournaments: A survey, J. Graph Theory, No. 28, (1998), pp. 171-202
 
Alternating cycles and trails in 2-edge-coloured multigraphs, Discrete Maths., No.188, (1998) pp.61-72
 
Bang-Jensen, J., Gutin, G. and Yeo, A.
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs, J. Graph Theory, No. 29, (1998), pp. 111-132
 
Properly coloured Hamiltonian paths in edge-coloured complete graphs, Discrete Applied Mathematics, No. 83, (1998), pp. 267-270
 
Bang-Jensen, J. and Jackson, B.
Augmenting hypergraphs by edges of size two, Mathematical Programming. To appear
 
Bedford, D.
Quasi-orthogonal Latin squares and related designs , Journal of Combinatorial Mathematics and Combinatorial Computing, No. 26, (1998),pp. 213-224
 
Bedford, D. and Johnson, M.
Weak uniquely completable sets for finite groups, submitted
 
Bedford, D. and Whitaker, R.
Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8, Discrete Mathematics, to appear
 
New and old values for maximal MOLS(n), Ars Combinatoria, to appear
 
Large sets of mutually quasi-orthogonal Latin squares, submitted
 
Bell, S., Jones, P. and Siemons I. J.
On modular homology in the Boolean algebra II, Journal of Algebra, No. 199, (19980, pp. 556-580
 
Bender E.A., Cameron, P.J., Odlyzko, A.M. and Richmond B.L.
Connectedness, classes, and cycle index, Combinatorics, Probability and Computing, in press
 
Bending, T.D. and Fon-Der-Flaass, D.
Crooked Functions, Bent Functions, and Distance Regular Graphs, Electronic Journal of Combinatorics, No. 5(1), R34 (1998) 14pp.
 
Bennet, G. K., Grannell, M.J. and Griggs, T.S.
Bi- embeddings of the projective space PG(3,2), Journal of Statistical Planning and Inference, to appear
 
Bi-embeddings of Steiner triple system of order 15, submitted
 
Bhattacharjee, M., Macpherson, H.D. Moller, R.G., Neumann, P.M.
Notes on infinite permutation groups, Hindustan Book Agency, (New Delhi: 1997), (to appear in Springer Lecture Notes, in Mathematics No. 1698)
 
Biggs, N.L.
Constructions for cubic graphs with large girth, Electronic Journal of Combinatorics, No. 5, (1998), A1.
 
Review of 'Spectral Graph theory' and 'Eigenspaces of Graphs', Bull. London Math. Soc., No. 30, (1998), pp. 197-199
 
Biggs, N.L. andFon-der-Flaass, D.G.
Optimising the signal to noise ratio, CDAM Research Report series, LSE-CDAM-98-16, (1998)
 
Biggs, N.L., Lloyd E.K. and Wilson R.J.
Graph theory 1736-1936, Clarendon Press, reprinted with corrections, 1998
 
Billington, E.J. and Cavenagh, N.J.
Decompositions of complete n-partite graphs into cycles, Graphs and Combinatorics, to appear
 
Bondy, J. A. and Jackson, B.
Uniquely Hamiltonian graphs, J. Combinatorial Theory, No. 74, (1998), pp. 265-275
 
Bonnington, P., Grannell, M.J., Griggs, T.S.
Exponential families of non-isomorphic triangulations of complete graphs, submitted
 
Borodin, O.V., Kostochka, A.V. and Woodall, D.R.
List edge and list total colourings of multigraphs, Journal of Combinatory Theory Ser. B., No. 71, (1997) pp.184-204
 
Total colourings of planar graphs with large girth, European J. Combinatorics, No. 19 (1998) pp. 19-24
 
Acyclic colourings of planar graphs with large girth, Journal of London Mathematical Society, to appear
 
On Kernel perfect orientations of line graphs, Discrete Mathematics, to appear
 
 
Borodin, O.V. and Woodall, D.R.
Cyclic degrees of 3-polytopes, Graphs and Combinatorics, to appear
 
Short cycles of low weight in normal plane maps with minimum degree 5, Discus. Math. Graph Theory, to appear
 
Cyclic colourings in 3-polytopes with large maximum face size, submitted
 
Weights of faces in plane maps, submitted (in Russian)
 
Bouchet, A. and Jackson, B.
Parity Systems and the delta matroid intersection problem, submitted
 
Breuer, T. and Linton S.A.
The GAP4-type system: organising algebraic algorithms, Proc. ISSAC 1998, (Gloor, R., ed., ACM 1998) pp. 38-45
 
Brien, C.J. and Payne, R.W.
Tiers, structure formulae and the analysis of complicated experiments, Journal of the Royal Statistical Society, Series D, in press
 
Brightwell, G., Balinska, K. and Quintas, L.
Graphs whose vertices are graphs with bounded degree: distance problems, Journal of Mathematical Chemistry, (1998), pp. 109-121
 
Brightwell, G. and Bollobás, B.
Convex bodies, graphs and partial orders, Proceedings of the LMS, to appear
 
Brightwell, G., Grable, D. and Promel, H.-J.
Forbiddden induced partial orders, Discrete Mathematics, Special issue on Partially Ordered Sets, Trotter, W.T. (ed.), to appear
 
Balanced pairs in partial orders, Discrete Mathematics, Special issue on Partially Ordered Sets, Trotter, W.T. (ed.), to appear
 
Brightwell, G., Häggström, O. and Winkler, P.
Non-monotonic behaviour in hard-core and Widom-Rowlinson models, Journal of Statistical Physics, to appear
 
Brightwell, G. and Winkler, P.
Graph homomorphisms and phase transitions, J. Combinatorial Theory (B), to appear
 
Brightwell, G., Oriolo, G. and Shepherd, F.B.
Some strategies for reserving resilient capacity, CDAM Research Report Series, LSE-CDAM-98-04
 
Bruckner P., Gladky, A., Hoogeveen, J.A, Kovalyov, M.Y., Potts, C.N., Tautenhahn, T. and Velde, S.L.v.d.
Scheduling a batching machine, Journal of Scheduling, No. 1, (1998), pp. 31-54
 
Bubley, R. and Dyer, M.
Path coupling: a technique for proving rapid mixing in Markov chains, in 38th Annual Symposium on Foundations of Computer Science, IEEE, Miami Beach, Florida, (1997), pp. 223-231
 
Graph orientations with no sink and an approximation for a hard case of SAT, in 8th Annual Symposium on Discrete Algorithms, ACM-SIAM, New Orleans, Loisiana, (1996), pp.248-257
 
Faster random generation of linear extensions, in 9th Annual Symposium on Discrete Algoritms, ACM-SIAM, San Francisco, California, (1998), pp.350-354
 
 
Bubley, R., Dyer, M. and Greenhill, C.
Beating the 2Δ bound for approximately counting colourings: a computer assisted proof of rapid mixing, in 9th Annual Symposium on Discrete Algorithms, ACM-SIAM, San Francisco, California, (1998), pp.355-363
 
Bubley, R., Dyer, M. and Jerrum, M.
An elementary analysis of a procedure for sampling points in a convex body, Random Structures and Algorithms, No. 12 (1998), pp.213-235
 

C

Cairnie and Edwards, K.J.
Some result on the achromatic number, Journal of Graph Theory, No. 26, (1997), pp. 129-136
 
The achromatic number, Discrete Mathematics, No. 188, (1998), pp. 87-97
 
Calkin, N.J. and Cameron, P.J.
Almost odd random sum-free sets, Combinatorics, Probability and Computing, No. 7, (1998), pp. 27-32
 
Cameron, P.J.
Introduction to Algebra, Oxford University Press, Oxford: 1998, 295pp.)
 
Sets, Logic and Categories, SUMS, Springer Verlag, London, to appear in February 1999
 
Permutation Groups, LMS Student Texts, Cambridge University Press, Cambridge, to appear
 
On an algebra related to orbit-counting, Journal of Group Theory, No.1, (1998), pp. 173-179
 
A census of infinite distance transitive graphs, Discrete Mathematics, No. 192, (1998), pp.11-26
 
SGDs with 2-transitive automorphism group, in preparation
 
Some counting problems related to permutation groups, in preparation
 
Some bridges between codes and designs, in preparation
 
Cameron, P.J. and Erdös, P.
Notes on sum-free and related sets, Combinatorics, Probability and Computing, in press
 
Cameron, P.J. and Hodges, W.A.
Some combinatorics of imperfect information, in preparation
 
Cameron, P.J. and Szabo, C.
Independence algebras, in preparation
 
Campbell, C.M., Robertson, E.F. , Ruskuc, N. and Thoman, R.M.
Direct products of automatics semigroups, submitted
 
Campbell, C.M., Havas, George, Linton S.A. and Robertson, E.F.
Symetric presentations and orthogonal groups, in The Atlas of finite groups: Ten years on (Curtis, Robert and Wilson, Robert (eds.)) London Mathematical Society lecture Note series No. 249. Cambridge University Press, Cambridge, 1998) pp. 1-10
 
Chapman, R.J.
Moments of Dyck Paths, Discrete Mathematics, to appear
 
Cavenagh, N.J.
Decompositions of complete tripartite graphs into k-cycles, Australasian Journal of Combinatorics, No.18, (1998), pp. 193-200
 
Chen, B., Potts, C.N. and Woeginger, G.J
A review of machine scheduling: Complexity, algorithms, and approximability, in Handbook of Combinatorial Optimisation (Du, D.Z. and Pardalos, P.(eds.)) (1998), Kluwer Academic Publ., to appear
Chen, B., Potts, C.N. and Strusevich, V.A.
Approximation for two machine flow shop scheduling with batch setup times, Mathematical Programming, No. 82, (1998), pp. 255-271
 
Chen, B., Vestjens, A.P. and Woeginger, G.J
On-line scheduling of two machine open shops where jobs arrive over time, Journal of Combinatorial Optimalisation, No. 1(1997), pp. 355-365
 
Chen, B. and Vestjens, A.P.
Scheduling on identical machines: How good is LPT in an on-line setting?, Operation Research Letters, No. 21 (1997) pp. 165-169
 
Chetwynd, A., Diggle, P., Drewett, R. and Young B.
A mixture model for sucking patterns of breast-fed infants, Statistics in Medicine, No. 17, pp. 395-405
 
Chetwynd and A., Diggle, P.
On estimating the reduced second moment measure of a stationary spatial point process, Australian Journal of Statistics, No. 40, pp. 11-15
 
Chetwynd, A., Diggle, P., Marshall, A. and Parslow, R.
Investigation of spatial clustering from matched and stratified case-control studies, submitted
 
Christie, D.A., Irving, R.W.
Sorting strings of global transformation, submitted
 
Christofi, C.
On the number of 6 x 7 double Youden rectangles, Ars Combinatoria, No. 47, (1997), pp. 223-241
 
Cohen, S.D.
Polynomial factorisation and an application to regular directed graphs, Finite Fields and their Applications, No. 4 (1998), pp. 316-346
 
Some function field estimates with applications, in Number theory and applications, Proc. Bilkent Summer School 1996), Marcel Dekker, 1998
 
Cohen, S.D. and Hachenberger
The dynamics of linearised polynomials, Proc. Edinburgh Math Society, to appear
 
Colbourn, C.J., Grannell, C.J., Griggs, T.S. and Siran J.
Construction techniques for anti-Pasch steiner triple systems, submitted
 
Conway, J.H. Hulpke, J.A. and McKay, J.
On transitive permutation groups, London Mathematical Society Journal of Computing and Mathematics, No.1 (1998), pp.1-8
 
Cooper, S., Hirschhorn, M. and Lewis, R.P.
Powers of Euler's product and related identities, submitted
 
Cossidente, A., Hirschfeld, J.W.P., Korchmaros, G. and Torres, F.
On plane maximal curves, Compositional Mathematics, to apppear
 
Crane, C., Duffy, J. Knight, B. and Rooney, J.
An investigation of some special motions of an octahedron manipulator using screw theory, Florida Conference on recent advances in Robotics, Melbourne, Florida, U.S.A., March 26-27, 1998
 
Crauwels, H.A.J., Potts, C.N. and Van Wassenhove, L.N.
Local search heuristics for the single machine total weighted tardiness scheduling problem, INFORMS Journal of Computing, No. 10 (1998), pp. 341-350
 
 
Cropper, M.M., Hilton A.J.W, Goldwasser, J.L., Hoffmann, D.G. and Johnson, P.D.
Extending the disjoint representation theorems of Hall Halmos and Vaughan to lost multicolourings of graphs, submitted
 
Cryan, M., Goldberg, L.A. and Goldberg, P.W.
Evolutionary trees can be learned in Polynomial Time in the two state General Markov Model, Proceedings of Symposium on Foundations of Computer Science, 1998
 
Curtis, R.T.
The exceptional automorphism and covers of the symmetric groups, (preprint)
 
Cuypers, H., Sterk, H. and Soicher, L.H.
Working with finite groups, in Some Tapas of computer algebra, (Cohen. AM., Cuypers, N.J., Sterk H. (eds.)), Springer, (Berlin / New York: 1998)
 
Project: the small Mathieu groups, in Some Tapas of computer algebra, (Cohen. AM., Cuypers, N.J., Sterk H. (eds.)), Springer, (Berlin / New York: 1998)
 
Cvetkovic, D., Lepovic, M., Rowlinson, P., Simic, S.K.
A database of star complements of graphs, submitted
 

D

Danziger, P., Grannell, M.J., Griggs, T.S. and Rosa, A.
On the 2-parallel chromatic index of Steiner triple systems, submitted
 
Davis, J.A. and Jedwab, J.
A new family of relative difference sets in 2-groups, Designs, Codes and Cryptography, to appear
 
Peak-to-mean power control in OFDM, Golay complementary sequences and Reed-Muller codes, IEEE Transactions on Information Technology, to appear
 
Some recent developments in difference sets, Combinatorial Designs and their applications, (Holroyd, F.C., Quinn, K.A.S., Rowley, C.A. and Webb, B.S. eds.), Chapman & Hall/CRC Press research notes in Mathematics, CRC Press LLC, Boca Raton, to appear
 
A unified approach to difference sets with gcd(v,n)>1, submitted
 
Davis, J.A. and Jedwab, J. and Mowbray, M.
New families of semi-regular relative difference sets, Designs, Codes and Cryptography, No 13, (1998), pp. 131-146
 
Davis, J.A. and Jedwab, J. and Paterson, K.G.
Codes, correlations and power control in OFDM, submitted
 
Dent S. and Siemons, I.J.
On a conjecture of Foulkes, submitted
 
Du, D., Han J. and Chen B.
An improved heuristic for one-machine scheduling with delays constraints, Science in China, No. 40, (1997), pp. 680-686
 
Dugdale, J.K. and A.J.W. Hilton
A sufficient condition for a graph to be the core of a class 2 graph, Combinatorics, Probability and Computing, to appear
 
Duff, J., Lee, J. and Rooney J.
Tensigrity and compegrity configurations in anti-prism manipulator platforms, 10th World Congress on the Theory of Machines and Mechanisms (IFToMM), Oulo, Finland, June 20-24, 1999, submitted
 
Dunbar, J.E., Monroe, T.R. and Whitehead, C.A.
Sensitivity of the upper irredundance number to edge addition, submitted
Dyer, M., Frieze, A. and Jerrum, M.
On counting independent sets in sparse graphs, (1998), preprint
 
Approximately counting Hamilton paths and cycles in dense graphs, SIAM Journal of Computing, No. 27, (1998), pp. 1262-1272
 
Dyer, M. and Greenhill, C.
A genuinely polynomial-time algorithm for sampling two-rowed contingency tables, in 25th International colloqium on automata, languages and programming, EATCS. Aalborg, Denmark, (1998), pp. 339-350
 
A more rapidly mixing Markov chain for graph colourings, Random Structures and Algorithms, (1998), to appear
 
Some #P-completeness proofs for colourings and independent sets, Tech. Reports No. 47, School of computer studies, University of Leeds (1997)
 
On Markov chains for independent sets, (1997), preprint
 

E

Ebert, G.L. and Hirschfeld, J.W.P.
Complete systems of lines on a Hermitian surface over a finite field, submitted
 
Edwards, H., Hierons, R.M. and Jackson, B.
The Zero-free Intervals for Characteristic Polynomials of Matroids, Combinatorics, Probability and Computing, No. 72, (1998), pp. 153-165
 
Edwards, K.J.
A new upper bound for harmonious chromatic number, Journal of Graph Theory, No, 29, (1998) pp. 257-261
 
The harmonious chromatic number of complete r-ary trees, Discrete Mathematics, to appear
 
Escott, A.E. and Jenkins, S.
Binary Huffmann equivalent codes with a short synchronising codeword, IEEE Trans. Information Theory, No 44 (1), (1998), pp. 346-351
 
Eslakchi, Ch. and Hilton, A.J.W.
The Hall-condition index of a graph and the overfull conjecture, submitted
 

F

Faudree, R. and Sheehan, J.
The maximum number of edges in a graph with fixed edge-degree, Discrete Mathematics, No 183, (1998) pp. 81-101
 
Fitzpatrick, P. and Jennings, S.M.
Comparison of two algorithms for decoding alternant codes, to appear in AAECC
 
Fleischmann, P.
Finite fields, root systems, and orbit numbers of Chevalley groups, Finite Fields and their Applications, No. 3, (1997), pp. 99-47
 
Polynomial identities for orbit numbers of general linear unitary groups over finite fields, Linear Algebra and its Applications, No. 253, (1997), pp. 341-362
 
Squarefree Polynomials over finite fields and regular semisimple classes of certain classical groups, Finite Fields and their Applications, No. 4, (1997), pp. 113-139
 
Flury, B.D., Gloria, M.N. and Irving R.W.
Magic Dice, American Math Monthly, to appear
 
Fon-der-Flaass, Dima
On exponential trees, European Journal of Combinatorics, No.19, Vol.1, (1998), pp.25-27
 
Fon-der-Flaass, D.G. and Belegradek, B.
New approach to pricing: earn while you earn, submitted to Information Processing Letters
 
More Distance Regular Graphs and Association Schemes from Crooked Functions, submitted to Journal of Algebraic Combinatorics
 
Fon-der-Flaass, D.G. and Bending, T.
Crooked Functions, Bent Functions, and Distance Regular Graphs, Electronic Journal of Combinatorics, No.5, R34, (1998).
 
Real-valued frequency assignment, CDAM Research Report Series, LSE-CDAM-98-12, (1998)
 
Fon-der-Flaass, D.G. and Biggs, N.
Optimising the signal-to-noise ration, CDAM Research Report Series, LSE-CDAM-98-16, (1998)
 
Fon-der-Flaass, D.G., Kostochka, A.V. and Woodall, D.R.
Transversals in uniform hypergraphs with property (7,2), submitted.
 
Real-valued frequency assignment, CDAM Research Report series, LSE-CDAM-98-12, (1998)
 

G

Gerace, I., Irving R.W.
The travelling salesman problem in circulant graphs, submitted
 
Gibbons, A., Muthukrishnan, S. and Pu, I.
Exact expected case analysis of a simple heuristic for compressed Array storage, Proceedings of the of the Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA '98), (Perth:07/1998), ISBN-18634-26582
 
Gibbons, A. and Pu, I.
A Las Vegas RNC Algorithm for the uniform Generation of unlabelled Graphs, Proceedings of the of the Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA '98), (Perth:07/1998), ISBN-18634-26582
 
Gilbey, J.D., and Kalikow, L.H.
Parking functions, valet functions and priority queues, Discrete Mathematics, in press
 
Giudici, M.R. and Praeger, C.E.
Completely transitive codes in Hamming graphs, in preparation
 
Goddyn, L.A. and Jackson, B.
Removable circuits in binary matroids, to appear
 
Goldberg , L.A. and Jerrum, M.
The "Burnside process" converges slowly , Proceedings of Random 1998, in Randomisation and Approximation Techniques in Computer Science (M. Luby et al., eds.), Springer-Verlag Lecture Notes in Computer Science, No. 1518, pp. 331-345
 
Randomly sampling Molecules, to appear in SIAM Journal on Computing
 
Goldberg , L.A., Jerrum, M. and Mac Kenzie, P.D.
An Ω(√(log log n)) lower bound for routing in optical networks, SIAM Journal on Computing, No. 27, (1998), pp. 1083-1098
 
Gordon, N.A., Jarvis, T.M. and Shaw, R.
The classes of GL (n,2), n<=6, submitted
 
Sp(2m,2) inside GL(2m,2), Hull Math. Research Reports XI, (1998), No. 15
 
Gordon, N.A., Lunardon, G. and Shaw, R.
Linear sections of Gl (4,2), Bull. Belg. Math. Soc., No. 5, (1998), pp. 287-311
Grannell, M.J. and Griggs, T.S.
Configurations in Steiner triple systems, in Combinatorial Design and their Applications, Chapman & Hall/CRC Press Research Notes in Mathematics, to appear
 
Grannell, M.J., Griggs, T.S. and Mathon, R.
Steiner systems S(5,6,v) with v=72 and 84, Mathematics of Computation 67, (1998), No. 221, pp. 357-359, s51-59
 
Grannell, M.J., Griggs, T.S. and Murphy, J.P.
Perfect Steiner triple systems, Journal of Combinatorial Design, to appear
 
Switching cycles in Steiner triple systems, Utilitas Mathematica, to appear
 
Grannell, M.J., Griggs, T.S. and Quinn, K.A.S.
All possible 3.(v,4, λ)directed design exists, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear
 
Mendelsohn directed triple systems, submitted
 
Grannell, M.J. and Griggs, T.S. and Siran, J.
Surface embeddings of Steiner triple systems, Journal of Combinatorial Design, No. 6, (1998), pp. 325-336.
 
Face 2-colourable triangular embeddings of complete graphs, Journal of Combinatorial Theory, (B), No. 74, (1998), pp.8-19
 
Grannell, M.J., Griggs, T.S. and Wallace, J.
The smallest defining set of Steiner triple system, Utilitas Mathematica, to appear
 
Grannell, M.J. and Rosa A.
Cycles in 2-factorisations, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear
 
Griggs, T.S.
(see Anderson, I, Bennet, G.K., Bonnington, P., Colbourn, C.J., Danziger, P., and Grannel, M.J.)
 
Gutin, G.
A note on cardinality of certain classes of unlabeled multipartite tournaments, Discrete Mathematics, No. 186, (1998), pp. 277-280
 
Exponential neighbourhood local search for the travelling salesman problem, To appear in Special Issue of Computers and OR, (1999), on the TSP
 
Connected (g,f)-factors and supereulerian disgraphs, To appear in Ars Combinatoria
 
Gutin, G., Kostochka, A., and Toft, B.
On the Hajós number of Graphs, to appear in Discrete Maths.
 
Gutin, G., Sudakov, B. and Yeo A.
Note on altering directed cycles, Discrete Maths., No. 191, (1998), pp. 101-107
 
Gutin, G. and Yeo A.
Small diameter neighbourhood graphs for the travelling salesman problem; at most four moves from tour to tour, to appear in Special Issue of Computers and OR, (1999), on the TSP
 
Note on the path covering number of a semicomplete multipartite digraph, to appear in J. Combinatory Mathematics and Combinatorial Computing
 
Gutin, G. and Zverovich V.
Upper Domination and Upper Irredundance Perfect Graphs, Discrete Maths., No. 190, (1998), pp. 95-105
 

H

Hall, N.G. Posner, M.E. and Potts, C.N.
Scheduling with finite capacity output buffers, Operational Research, No. 46, (1998), pp.84-97
 
Scheduling with finite capacity input buffers, Operational Research, No. 46, (1998), pp.154-159
 
Hammond, P.R., Lewis, R.P. and Liu Z.-G.
Hirschhorn's identities, submitted
 
Hartnell, B.L. and Whitehead C.A.
On k-packings of Graphs, Ars Combinatoria, No. 47, (1997), pp. 97-108
 
Hartnell, B.L., Jorgenson, L.K., Vestergaard, P.D. and Whitehead, C.A.
Edge Stability of the k-domination number of trees, Bulletin of the ICA, No. 22, (1998), pp. 31-40
 
Hartnell, B.L. Rall, D.F. and Whitehead C.A.
The watchman's walk problem: an introduction, to appear
 
Hierons, R.M.
Testing from semi-independent communicating finite state machines with a slow environment, IEE Proccedings on Software Engineering, No. 144, (1997), pp. 291-295
 
Minimising the costs of Fault Location when testing from a finite state machine, Computer Communications, to appear
 
Adaptive testing of a deterministic Implementation against a nondeterministic finite state machine, The Computer Journal, No. 41, (1998), p.5
 
Higgins, P.M., Howie, J. M, and Ruskuc, N.
On relative ranks of full transformation semigroups, Comm. Algebra, No. 26 (1998), pp. 733-748
 
Generators and Factorisation of transformation Semigroups, Proc. Royal Society Edinburgh, to appear
 
Hill, R.
Giuseppe Tallini - a survey of some of his papers and personal memories, Results in Mathematics, No.32, (1997) pp. 254-259.
 
The pigeonhole principle, letter to OR Newsletter, March 1998, p.17
 
An extension theorem for linear codes, Designs, Codes and cryptography, to appear
 
Book review of "Projective Geometries over finite fields" by Hirschfeld, J.W.P., Bull London Math Society, to appear
 
Hill, R., Berlekamp, E.R. and Karim, J.P.
The solution of a problem of Ulam on searching with lies, Proc. IEEE International Symposium of Info theory, MIT Cambridge, USA, (1998), p.244
 
Hill, R. and Elzaidi, S.M.
Cubes and inverses of magic squares, Math Gazette, No 489, (1996), pp. 565-567
 
Hill, R. and Jones, C.M.
The nonexistence of ternary (47,6,29) codes, Proc. 2nd International Workshop on Optimal Codes, Sozopol, Bulgaria (1998), pp.90-96
 
Hill, R. and Kolev E.
A survey of recent results on optimal linear codes, in Combinatorial Design and their Applications, Chapman and Hall/CRC Press Research Notes in Mathematics, ed. FC Holroyd et al, CRC Press, Boca Raton, to appear
 
An improved bound on the covering number K2(9,1), Discrete Math, to appear
Hill, R. and Landjev, I.N.
On the non-existence of some quaternary codes, in Applications of Finite Fields, Gollmann, D. (ed.), Oxford University Press (1996), pp. 85-98
 
Hill, R. and Lizak, P.
Some geometric constructions of optimal quaternary codes, Proc. IEEE Intern. Symposium on Info Theory, Ulm, Germany (1997), p. 114
 
Hilton, A.J.W. and Goldwasser, J.L.
The scope of three colouring conjectures, J. Combinatorial Math. and Combinatorial Computing, to appear
 
Hilton, A.J.W. and Hind, H.R.
Non-conformable subgraphs of non-conformable graphs, submitted
 
Hilton, A.J.W., Holroyd, F.C. and Zhao, C.
The overfull conjecture and the conformability conjecture, submitted
 
Hilton, A.J.W. and Johnson, P.D.
The Hall number, the Hall index and the total Hall number of a graph, Discrete Applied Math., to appear
 
Relations among the fractional chromatic, choice, Hall and Hall-condition numbers of simple graphs, submitted
 
Hilton, A.J.W. and Rodger, C.A.
Hamiltonian double latin squares, to appear
 
Hilton, A.J.W., Slivnik, T. and Stirling, D.S.G.
A vertex splitting lemma, de Werra's theorem and improper list colourings, J. Combinatorial Theory (B), No. 72, (1998), pp. 91-103
 
Hilton, A.J.W. and Stirling, D.S.G.
The dual of an identity of Ahlwede and Zhang, Congressus Numerantium, to appear
 
Hilton, A.J.W. and Wojciechowski, J.
Fractional latin squares, simplex algebras and generalised quotients, in The Algebra and Geometry of Designs, Colbourn, C. and Deza, M. (eds.), special volume of J. Statistical Planning and Inference in honour of R. Stanton, to appear
 
Hiramine, Y., Jha, V. and Johnson, N.L.
Two-transitive ovals in generalised twisted field planes, Archiv der Mathematik, to appear
 
Hirschfeld, J.W.P,
Buekenhout-Metz unital, in Encyclopaedia of Mathematics, Supplement Volume I, Kluwer, 1997, p. 161

Unital, in Encyclopaedia of Mathematics, Supplement Volume I, Kluwer, 1997, p. 475
 
W.L. Edge, in The Times, 21/10/1997
 
Codes on Curves and their geometry, Rend. Circ. Mat. Palermo Suppl., No. 51, (1998), pp. 123-137
 
Curves and configurations in finite spaces, , Rend. Circ. Mat. Palermo Suppl., No. 53, (1998), pp. 69-87
 
Hirschfeld, J.W.P and Korchmaros, G.
On the number of rational points on an algebraic curve over a finite field, Bull. Belg. Math. Soc., Simon Stevin, No. 5, (1998), pp. 313-340
 
Arcs and curves over a finite field, submitted
 
Hirschfeld, J.W.P and Ledermann, W.
D.B. Scott, Bulletin of London Mathematical Society, No. 30, (1998), pp.549-554
 
Hirschfeld, J.W.P and Storme, L.
The packing problem in statistics, coding problems and finite projective spaces, J. Statist. Plann. Inference, No. 72, (1998) pp. 355-380
 
Hobbs, J.D. and Rooney, J.
Towards kinematic classification schemes for planetary surface locomotion systems, submitted
 
Hochstattler, W. and Jackson, B.
Large circuits in binary matroids of large cogirth I and II, J. Combinatorial Theory, No, 74, (1998), pp. 35-63
 
Hoggar, S. G.
64 lines from a quaternionic polytope, Geometriae Dedicata, No. 69, (1998), pp. 287-289
 
Fractal dimension and equine bone, Proc. 16th Eurographics UK Conference, Leeds University, 1998, pp. 191-198
 
Hoggar, S.G., and Martinelli, M.J.
The computer as a search tool, in Computers in Veterinary Medicine, Romney Publications, 1998
 
Hoggar, S.G., McAlpine, K. and Miranda, E.T.
Dynamical Systems and applications in music compositions, Proc. Journee d'Informatique Musicales, 1997, pp. 106-113
 
A cellular automaton-based music algorithm, Proc. IV Brazilian Symp. On Computer Music, (1997), pp. 7-17
 
Making music with algorithms, Computer Music Journal, to appear
 
Hoggar, S.G., Menzies, L.
Fractal compression and the jigsaw property I, The Computer Journal, to appear
 
Fractal compression and the jigsaw property II, under revision
 
Holroyd, F.C., Quinn, K.A.S., Rowley, C.A., Webb, B.S. (eds.)
Balancing carry-over effects in tournament, Combinational Design and their Applications, Pitmann research notes, to appear
 
Holroyd, F.C., Quinn, K.A.S., Rowley, C.A., Webb, B.S.
Combinatorial Design and their Applications, Chapman & Hall / CRC Press Research notes in Mathematics, to appear
 
Hulpke, J.A.
Computing normal Subgroups, Proc. ISSAC 1998 (Gloor, A., ed., ACM, 1998), pp. 38-45
 
Galois Groups through irrelevant relations, Proc. Groups St. Andrews 1997 in Bath, (Campbell, C.M., Robertson, E.F. and Ruskuc,N.(eds.), Cambridge University Press, Cambridge), to appear
 
Hulpke, J.A. and Linton, S.A.
Construction of Co3. An example of the use of an integrated system for Computational Group Theory, Proc. Groups St. Andrews 1997 in Bath, (Campbell, C.M., Robertson, E.F., Ruskuc,N. and Smith G.C.(eds.), Cambridge University Press, Cambridge), to appear
 
Hurley, S., Smith, D.H. and Valenzuela C.
A permutation based algorithm for minimum span frequency assignment, to appear
 
Hurley, S. and Smith, D.H.
Meta-heuristics and channel assignment, to appear
 
 
Huybrechts, C. and Pasini, A.
Flag-transitive extensions of dual projective spaces, Bull. Belgian Math. Soc.-Simon Stevin, No. 5, (1998), pp. 341-352
 

I

Irving, R.W.
Matching medical students to pairs of hospitals: a new variation on an old theme, Proc. ESA'98, Venice 1998, Lecture Notes in Computer Sciences, No. 146, Springer Verlag, (1998), pp. 381-392
 
Irving, R.W., Manlove, D.F.
The B-chromatic number of a graph, Discrete Applied Math., to appear
 

J

Jackson, P.S. and Rowlinson, P.
On graphs with complete bipartite star complements, submitted
 
Jackson, B. and Sheehan, J.
The structure of transform graphs, Discrete Maths, No. 177, (1997), pp. 123-144
 
Jackson, B. and Whitehead, C.A.
Some remarks on Jaeger's Dual-Hamiltonian Conjecture, Annales de l'institue Fourier, submitted
 
Jackson, B. and Yu, X.
Hamilton cycles in plane triangualtions, Journal of Graph Theory, submitted
 
Jha, V. and Johnson, N.L.
Finite doubly transitive affine planes, (Notes), J. Combinatorial Theory, ser A, pp. 165-168
 
Cyclic Ostrom planes, Design Codes and Cryptography, in press
 
Jones, G.A. and Lloyd E.K.
Reaction Graphs, Acta Applicandae Mathematicae, No. 52 (1998) pp.121-147
 
Jennings, S.M. and Kessels, J.
Comparison of two Reed-Solomon Decoding Algorithms for the DCC Player in a VLSI Programming Language, to appear in Integrating, the VLSI journal
 
Jerrum, M.
Mathematical foundations of the Markov chain Monte Carlo method, in Probabilistic Methods for Algorithmic Discrete Mathematics, Habib, M. et al., eds., Algorithms and Combinatorics, Vol. 16, Springer Verlag, (1998), pp. 116-165
 
Jerrum, M. and Sorkin, G.B.
The Metropolis algorithm for graph bisection, Discrete Applied Mathematics, No. 82, (1998), pp. 155-175
 

K

Kostochka, A.V. and Woodall, D.R.
Sparse sets in the complements of graphs with given girth, submitted
 
Choosability conjectures and multicircuits, submitted
 
Density conditions for panchromatic colourings of hypergraphs, submitted
 

L

Lamb, J.D.
A note on weighted matching with penalty problem, Pattern Recognition Letters, No. 19, (1998), pp. 261-263
 
Efficient optimal equation formulation in lumped power conserving systems, Discrete Applied Maths., No 85, (1998), pp. 239-249
 
Landjev, I., Maruta, T. and Hill, R.
On the non-existence of optimal quaternary, (51, 4,37) codes, Finite Fields and their Applications 2, (1996), pp. 96-110
Leedham-Green, C.R. and Soicher, L.H.
Symbolic Collection using Deep Thought, London Mathematical Society Journal Comput. Math., No. 1, (1998) pp. 9-24
 
Lewis, R.P. and Liu, Z.-G.
On two identities of Ramanujan, J. Ramanujan Math. Soc., to appear
 
On an identity of Ramanujan, submitted
 
A conjecture of Hirschhorn on the 4-dissection of Ramanujan's continued fraction, submitted
 
Linton, S.A., Pfeifer, G., Robertson, E.F. and Ruskuc, N.
Groups and actions in transformation semigroups, Math. Z., No. 228 (1998), pp. 435-450
 
Liu, Bo Lian and Rowlinson, P.
Dominating properties of star complements, submitted
 
Lloyd, E.K.
Reaction graphs, and Cayley diagrams, Procedings of the Summer School and International Conference on Combinatorics, (Hefei, China, 1997), to appear
 
Bell polynomial, in: Encyclopaedia of Mathematics supplement 1, (ed. Hazewinkel, M.), Kluwer Academic, Dordrecht, 1997, pp. 95-98
 
Lah number, in Encyclopaedia of Mathematics supplement 1, (ed. Hazewinkel, M.), Kluwer Academic, Dordrecht, 1997, pp. 347-348
 
Some graphs associated with the seven point plane, submitted
 
Lothian, P.J.G. and Paterson, K.G.
Bounds on partial correlations of sequences, IEEE Transactions on Information Theory, No.44, (1998), pp 1164-1175
 

M

MacPherson, H.D. and Steinhorn, C.
Orbits of soluble infinite permutation groups, in Advances in Algebra and Model Theory, (Droste, M., Goebel, R.(eds.), Gordon and breach, (1997), pp. 87-92
 
Extending partial orders on o-minimal structures to definable total orders, Mathematical Logic Quarterly, No.43, (1997), pp. 456-464
 
Manlove, D.F.
On the algorithmic complexity of twelve covering and independence parameters of graphs, Discrete Applied Maths, to appear
 
Maynard, P. and Siemons, I.J.
On the reconstruction of linear codes, Journal of Combinatorial Design, No. 6, (1998), pp. 285-291
 
On the reconstruction index of a permutation group I, in preparation
 
Mc Donough, T.P., Mavron V.C., Pallikaros, C.A.
Generalised Hadamard Matrices and Translations, submitted
 
Mc Kee, J.F., Rowlinson, P., Smyth, C.J.
Salem number and Pisot numbers from stars, Proc. International Conference on Number Theory (Zakopane, Poland: 1997, De Gruyter) to appear
 
Mitchell, C.J. and Paterson, K.G.
Perfect factors from cyclic codes and interleaving, SIAM Journal on Discrete Mathematics, No. 11, (1998), pp.241-264
 
Mnukhin, V.B. and Siemons, I.J.
An orbit theorem, submitted Combinatorica
 
On modular homology in projective space, submitted Journal of pure and applied Algebra
 
The modular homology of shellable complexes, in preparation
 
Morgan, J.P. and Bailey, R.A.
Optimal design with many blocking factors, in preparation
 

N

Nash-Williams, C.St.J.A.
Obituary , Eric Charles Milner, J. London Math. Soc., to appear
 
Nash-Williams, C.St.J.A., and White, D.J.
An application of flows to rearrangement of series, J. London Math. Soc., to appear
 
Noble, S.
Evaluating the Tutte Polynomial for graphs of bounded tree-width, Combinatorics, Probability and Computing, No. 4, (1998) pp. 307-322
 
Noble, S. and Welsh, D.J.A.
A weighted graph polynomial from Vassiliev invariants, to appear in Journal de l'Institute Fourier
 
Nowakowski, R.J. and Whitehead, C.A.
On ordered graceful, labellings of the 2-star, submitted
 

P

Paterson, K.G.
Binary sequence sets with favourable correlation properties from difference sets and MDS Codes, IEEE Transactions on Information Theory, No. 11, (1998), pp. 172-180
 
Root counting, the DFT and the linear complexity of non-linear filtering, Designs, codes and Cryptography, No. 14, (1998), pp. 247-259
 
Generalised Reed-Muller codes and power control in OFDM modulation, submitted
 
Bounds on envelope power of trace codes for OFDM, submitted
 
Paterson, K.G. and Tuliani, J.
Some new circuit codes, IEEE Transactions on Information Theory, No.44, (1998), pp. 1305-1309
 
Payne, R.W.
Detection of partial confounding in generally balanced designs, Computational Statistics, No. 13, (1998), pp. 213-226
 
Construction of efficient identification schemes using batches of discrete-valued tests, Journal of classification, No. 15, (1998), pp. 185-197
 
Design keys, pseudo factors and general balance, Computational Statistics and data Analysis, No. 29, (1998), pp. 217-229
 
Perkins, S. and Smith D.H.
Synchronising codewords of q-ary Huffmann codes , Discrete Mathematics, to appear
 
Perkins, S. and Escott A.E.
Two short notes on Huffmann codes, submitted
 
Perkins, S. and Smith, D.H.
A scheme for the synchronisation of variable length codewords, submitted
 
 
Peterson, D, and Woodall, D.R.
Edge-choosability in line-perfect multigraphs, Discrete Mathematics, to appear
 
Phillips, N.C.K. and Preece D.A.
Tight single-change covering designs with v=12, k=4, Discrete Mathematics, to appear
 
Preece, D.A. and Phillips, N.C.K.
A new type of Freeman- Youden rectangle, Jounal of Combinatorial Mathematics and Combinatorial Computing, No. 25, (1997), pp. 65-78
 
Preece, D.A. and Vowden, B.J.
Some series of cyclic balanced hyper-Graeco-Latin superimpositions of Youden squares, Discrete Mathematics, to appear
 
Preece, D.A., Vowden, B.J. and Phillips N.C.K.
Double Youden rectangles of sizes p x (2p+1) and (p+1) x (2p+1), Ars Combinatoria, to appear
 
Double Youden rectangles of sizes (p+1) x (p+p+1), Utilitas Mathematica, to appear
 
Prince, A.R.
A complete classification of the flag-transitive affine planes of order 125, Journal of Combinatorial Designs, No. 5, (1997), pp. 147-153
 
Oval configurations of involutions in symmetric groups, Discrete Maths. No. 174, (1997), pp. 277-282
 
Parallelisms of PG(3,3), in Mostly Finite Geometries, (Johnson, N.L. ed.), Lecture Notes in Pure and Applied Mathematics 190, Marcel Dekker, (1997), pp. 383-390
 
Uniform parallelisms of PG(3,3), in Geometry, Combinatorial Designs and Related Structures, (Hirschfeld, J.W.P., et al, eds.), Cambridge University Press, (1997), pp. 193-200
 
The cyclic parallelism of PG(3,5), European Journal of Combinatorics, No. 19, (1998), pp. 603-612
 
Projective planes of order 12 and PG(3,3), Proceedings of Combinatorics '96 Conference, (Assisi, Italy, 1996), Discrete Mathematics, to appear
 
Flag-transitive affine planes of order 64, Designs, Codes and Cryptography, to appear
 

Q

Quinn, K.A.S.
Difference matrices and orthomorphisms over non-A|belian groups, Ars Combinatoria, to appear
 
Bounds for key distribution patterns , Journal of Cryptology, to appear
 

R

Read, R.C. and Wilson, R.J.
An Atlas of Graphs, Oxford University Press, Oxford 1998-12-18
 
Rees, D.H.
Some new generalised Kirkman systems, Utilitas Mathematica, to appear
 
Rees, D.H. and Preece, D.A.
Perfect Graeco-Latin balanced incomplete block designs, Discrete Mathematics, to appear
 
Rees, S.E. and Soicher, L.H.
An algorithmic approach to fundamental groups and covers of combinatorial cell complexes, Journal of Symbolic. Comp., to appear
 
Rhodes, F. and Melter, R.A.
Geodetic metrisations of graphs, Discrete Mathematics, No. 194, (1999), pp. 267-269
 
Robertson, E.F. and Ruskuc, N. and Wiegold, J.
Generators and relations of direct products of semigroups, Trans. American Mathematical Society, No. 350, (1998), pp.2665-2685
 
Rowlinson, P.
Star sets in regular graphs, Journal of Combinatorial Computing, to appear

On graphs with multiple eigenvalues, Linear Algebra and its Applications, 283, (1998) pp.75-85
 
Star sets and star complements in finite graphs: a spectral construction technique, Proc. DIMACS Workshop in Discrete Mathematical Chemistry, (March 1998), to appear
 
Ruskuc, N.
On large sub-semigroups and finiteness conditions of semigroups, Proc. London Math. Society, No. 76, (1998), pp. 383-405
 
Ruskuc, N. and Thomas, R.M.
Syntactic and Rees indices of sub-semigroups, Journal of Algebra, No. 205 (1998), pp. 435-450
 
Ryley, A., Thomas, O.D.J., Perkins, S. and Smith, D.H.
Synchronisation of sequences of variable length codewords, submitted
 

S

Sands, A.D.
Simulated Factorisations III, Algebra Colloqium, to appear
 
Shaw, R.
The classes of GL(n,q), Hull Math. Research Reports No. XI, (1998) No. 12
 
Every element of Gamma L (V) of finite order has a long cycle, Hull Math. Research Reports No. XI, (1998) No.13
 
Configuration of planes in PG (5,2), Discrete Math, to appear
 
A property of A 7, and a maximal 3-dimensional linear section of GL(4,2), Discrete Math., to appear
 
Siemons, I.J.
Kernels of modular inclusion maps, Discrete Mathematics, No. 174, (1997), pp. 309-315.
 
Siemons, I.J. and Zalesski, A.
Intersection of matrix algebras and permutation representations of PSL (n,q), in preparation
 
Smith, D.H., Allen, S.M. and Hurley S.
Lower bounds for channel assignment, to appear
 
Smith, D.H., Allen, S.M. and Hurley S. and Watkins, W.J.
Frequency assignment: Methods and Algorithms, Proceedings of NATO IST/ Symposium on Frequency Assignment, to appear
 
Smith, D.H., Hurley, S. and Thiel S.U.
Improving heuristics for frequency assignment problem, European Journal of Operational Research, 107(1) (1998) pp.76-86
 
Smith, D.H., Thomas, O.D.J. and Ryley, A.
Robust data compression applied to rotary head DSS-3 tapes, Electronics Letters, No.33(16)(1997) pp1372-1373
 
Soicher, L.H.
GRAPE, in Handbook of computer Algebra, Foundations, Applications and Systems, (Grabmeier, J., Kaltofen, E. and Weispfennig, V. (eds.)) Springer, Berlin/New York, to appear
 
Sparks, T.H., Biley, R.A. and Elston, D.A
Pseudoreplication- enough is enough, in preparation
 
Spence, E.
All 2-(27,7,3) designs are residual, Bull. Belg. Math. Soc., (1998), pp. 441-445
 
Spence, E. and van Dam, E.R.
Small regular graphs with four eigenvalues, Discrete Math., No. 189 (1998), pp. 233-257
 
Spence, E. and Pavcevic, M.O.
Some new symetric designs with λ = 10 having an automorphism of order 5, Discrete Math., to appear
 

V

van den Heuvel, J.
Radio channel assignment on 2-dimensional lattices, CDAM Research Report series, CDAM-LSE-98-05, submitted
 
van den Heuvel, J., Bauer, D., Morgana, A. and Schmeichel, E.
The complexity of toughness in regular graphs, Congressus Numerantium, No. 130, (19980, pp. 47-61
 
van den Heuvel, J. and Jackson B.
On the edge connectivity, hamiltonicity and toughness of vertex transitive graphs, submitted
 
van den Heuvel, J., Leese, R.A. and Shepherd, M.A.
Graph labelling and radio channel assignment, Journal of Graph Theory, No. 29, (1998), pp 263-283
 
van den Heuvel, J. and McGuiness, S.
Colouring and labelling of planar graphs, Proceedings of the Fourteenth International Wroclaw Symposium and Exhibition on Electromagnetic Compability, June 23-25, 1998, Janiszewski, J.M., Moroń, W. and Sega, W (eds.), Institute of Telecommunications (1998)
 
von Stengel, Bernhard
New maximal numbers of equilibria in bimatrix games, Discrete and Computational Geometry, No. 21 pp. 557-568.
 
Vowden, B.J.
A new infinite series of double Youden rectangles, Discrete Mathematics, to appear
 
Vowden, B.J. and Preece, D.A.
Some new infinite series of Freeman-Youden rectangles, Ars Combinatoria, to appear
 

W


Wilson, R.J.
Graph Theory, in History of topology, (I.M. James ed.), North Holland, Amsterdam, to appear
 
Woodall, D.R.
Edge-choosability of multicircuits, Discrete Maths., to appear
 

[button] To the Top of the page

[button] To the BCB Home page

Last change: 6 May 1999
Send comments to: bcb@cdam.lse.ac.uk.