Discrete Mathematics, Volume 197-198

Volume 197-198, 28 February 1999

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

Last update Fri May 17 19:59:46 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page