H.L. Abbott, D.R. Hare, Square critically 3-chromatic hypergraphs, Discrete Mathematics (197-198)1-3 (1999) pp. 3-13
F. Aguiló-Gost, New dense families of triple loop networks, Discrete Mathematics (197-198)1-3 (1999) pp. 15-27
R.E.L. Aldred, Michael D. Plummer, On matching extensions with prescribed and proscribed edge sets II, Discrete Mathematics (197-198)1-3 (1999) pp. 29-40
S.M. Allen, D.H. Smith, S. Hurley, Lower bounding techniques for frequency assignment, Discrete Mathematics (197-198)1-3 (1999) pp. 41-52
Ian Anderson, On the construction of balanced Room squares, Discrete Mathematics (197-198)1-3 (1999) pp. 53-60
C. Balbuena, A. Carmona, J. Fàbrega, M.A. Fiol, Superconnectivity of bipartite digraphs and graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 61-75
David Bedford, Roger M. Whitaker, Enumeration of transversals in the Cayley tablesof the non-cyclic groups of order 8, Discrete Mathematics (197-198)1-3 (1999) pp. 77-81
Anton Betten, Mikhail Klin, Reinhard Laue, Alfred Wassermann, Graphical t-designs via polynomial Kramer--Mesner matrices, Discrete Mathematics (197-198)1-3 (1999) pp. 83-109
Anton Betten, Reinhard Laue, Alfred Wassermann, New t-designs and large sets of t-designs, Discrete Mathematics (197-198)1-3 (1999) pp. 111-121
Elizabeth J. Billington, Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Discrete Mathematics (197-198)1-3 (1999) pp. 123-135
Aart Blokhuis, Christine M. O'Keefe, On deriving unitals, Discrete Mathematics (197-198)1-3 (1999) pp. 137-141
Jan Brousek, Zden{eˇ}k Ryjá{cˇ}ek, Ingo Schiermeyer, Forbidden subgraphs, stability and hamiltonicity, Discrete Mathematics (197-198)1-3 (1999) pp. 143-155
J.M. Brunat, M. Maureso, M. Mora, Endo-circulant digraphs: connectivity and generalized cycles, Discrete Mathematics (197-198)1-3 (1999) pp. 157-167
Gerard J. Chang, Min-Jen Jou, The number of maximal independent sets in connected triangle-free graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 169-178
Gary Chartrand, Frank Harary, Bill Quan Yue, On the out-domination and in-domination numbers of a digraph, Discrete Mathematics (197-198)1-3 (1999) pp. 179-183
Guantao Chen, Ronald J. Gould, Michael S. Jacobson, On 2-factors containing 1-factors in bipartite graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 185-194
Chao-Chih Chou, Chin-Mei Fu, Wen-Chung Huang, Decomposition of Km,n into short cycles, Discrete Mathematics (197-198)1-3 (1999) pp. 195-203
Brian Curtin, Distance-regular graphs which support a spin model are thin, Discrete Mathematics (197-198)1-3 (1999) pp. 205-216
D.P. Day, Ortrud R. Oellermann, Henda C. Swart, Bounds on the size of graphs of given order and l-connectivity, Discrete Mathematics (197-198)1-3 (1999) pp. 217-223
Yoshimi Egawa, Katsuhiro Ota, Vertex-disjoint claws in graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 225-246
Sergei Evdokimov, Marek Karpinski, Ilia Ponomarenko, Compact cellular algebras and permutation groups, Discrete Mathematics (197-198)1-3 (1999) pp. 247-267
Odile Favaron, Joël Puech, Irredundant and perfect neighborhood sets in graphs and claw-free graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 269-284
D. Ferrero, C. Padró, Disjoint paths of bounded length in large generalized cycles, Discrete Mathematics (197-198)1-3 (1999) pp. 285-298
Norman J. Finizio, Philip A. Leonard, Inductive extensions of some Z-cyclic whist tournaments, Discrete Mathematics (197-198)1-3 (1999) pp. 299-307
Eldar Fischer, Cycle factors in dense graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 309-323
W.L. Fouché, Symmetries and Ramsey properties of trees, Discrete Mathematics (197-198)1-3 (1999) pp. 325-330
W.L. Fouché, L.M. Pretorius, C.J. Swanepoel, Partition theorems for factorisations of ascending parameter words, Discrete Mathematics (197-198)1-3 (1999) pp. 331-350
Julian D. Gilbey, Louis H. Kalikow, Parking functions, valet functions and priority queues, Discrete Mathematics (197-198)1-3 (1999) pp. 351-373
Joan Gimbert, On the existence of (d,k)-digraphs, Discrete Mathematics (197-198)1-3 (1999) pp. 375-391
Willem H. Haemers, Minimum resolvable coverings with small parallel classes, Discrete Mathematics (197-198)1-3 (1999) pp. 393-396
Heiko Harborth, Silke Maasberg, All two-color Rado numbers for a(x+y)=bz, Discrete Mathematics (197-198)1-3 (1999) pp. 397-407
Bert L. Hartnell, Douglas F. Rall, A bound on the size of a graph with given order and bondage number, Discrete Mathematics (197-198)1-3 (1999) pp. 409-413
Michael A. Henning, Graphs with large restrained domination number, Discrete Mathematics (197-198)1-3 (1999) pp. 415-429
Cécile Huybrechts, L·L*-geometries and Dn-buildings, Discrete Mathematics (197-198)1-3 (1999) pp. 431-451
Stanislav Jendrol', Tomá{sˇ} Madaras, Roman Soták, Zsolt Tuza, On light cycles in plane triangulations, Discrete Mathematics (197-198)1-3 (1999) pp. 453-467
Martin Klazar, Extremal problems for colored trees and Davenport--Schinzel sequences, Discrete Mathematics (197-198)1-3 (1999) pp. 469-482
E. Kolev, R. Hill, An improved lower bound on the covering number K2(9,1), Discrete Mathematics (197-198)1-3 (1999) pp. 483-489
F. Larrión, V. Neumann-Lara, Clique divergent graphs with unbounded sequence of diameters, Discrete Mathematics (197-198)1-3 (1999) pp. 491-501
Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar, Polarities and 2k-cycle-free graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 503-513
Vladimir I. Levenshtein, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, Discrete Mathematics (197-198)1-3 (1999) pp. 515-536
Richard P. Lewis, The number of spanning trees of a complete multipartite graph, Discrete Mathematics (197-198)1-3 (1999) pp. 537-541
E.S. Mahmoodian, E. Mendelsohn, On defining numbers of vertex colouring of regular graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 543-554
Jaume Martí-Farré, Sets defining minimal vertex covers, Discrete Mathematics (197-198)1-3 (1999) pp. 555-559
John P. McSorley, Single-change circular covering designs, Discrete Mathematics (197-198)1-3 (1999) pp. 561-588
Mikhail Muzychuk, On the isomorphism problem for cyclic combinatorial objects, Discrete Mathematics (197-198)1-3 (1999) pp. 589-606
Atsuhiro Nakamot, Transformations in closed 2-cell embeddings on surfaces preserving specified properties, Discrete Mathematics (197-198)1-3 (1999) pp. 607-615
Víctor Neumann-Lara, The acyclic disconnection of a digraph, Discrete Mathematics (197-198)1-3 (1999) pp. 617-632
Víctor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia, A note on covering the edges of a graph with bonds, Discrete Mathematics (197-198)1-3 (1999) pp. 633-636
S. Perkins, A.E. Escott, Synchronizing codewords of q-ary Huffman codes, Discrete Mathematics (197-198)1-3 (1999) pp. 637-655
N.C.K. Phillps, D.A. Preece, Tight single-change covering designs with v=12, k=4, Discrete Mathematics (197-198)1-3 (1999) pp. 657-670
D.A. Preece, B.J. Vowden, Some series of cyclic balanced hyper-Graeco-Latin superimpositions of three Youden squares, Discrete Mathematics (197-198)1-3 (1999) pp. 671-682
Dieter Rautenbach, The influence of special vertices on strong domination, Discrete Mathematics (197-198)1-3 (1999) pp. 683-690
D.H. Rees, D.A. Preece, Perfect Graeco-Latin balanced incomplete block designs (pergolas), Discrete Mathematics (197-198)1-3 (1999) pp. 691-712
Israsema Sarmiento, A characterisation of jointless Dowling geometries, Discrete Mathematics (197-198)1-3 (1999) pp. 713-731
Ron Shaw, A property of A7, and a maximal 3-dimensional linear section of GL(4,2), Discrete Mathematics (197-198)1-3 (1999) pp. 733-747
Angelo Sonnino, Linear collineation groups preserving an arc in a Möbius plane, Discrete Mathematics (197-198)1-3 (1999) pp. 749-757
K.J. Swanepoel, Cardinalities of k-distance sets in Minkowski spaces, Discrete Mathematics (197-198)1-3 (1999) pp. 759-767
Meike Tewes, Lutz Volkmann, Vertex deletion and cycles in multipartite tournaments, Discrete Mathematics (197-198)1-3 (1999) pp. 769-779
H. Trommel, H.J. Veldman, A. Verschut, Pancyclicity of claw-free hamiltonian graphs, Discrete Mathematics (197-198)1-3 (1999) pp. 781-789
Kazuhiko Ushio, {S^}k-factorization of symmetric complete tripartite digraphs, Discrete Mathematics (197-198)1-3 (1999) pp. 791-797
© Copyright 1999, Elsevier Science, All rights reserved.