Discrete Mathematics, Volume 196

Volume 196, Numbers 1-3, February 1999

• Krishnaswami Alladi:
  A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theorem. 1-11
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen:
  Linkages in locally semicomplete digraphs and quasi-transitive digraphs. 13-27
  Electronic Edition (link) BibTeX
• Jan Brousek, Zdenek Ryjácek, Odile Favaron:
  Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. 29-50
  Electronic Edition (link) BibTeX
• Owen D. Byer:
  Two path extremal graphs and an application to a Ramsey-type problem. 51-64
  Electronic Edition (link) BibTeX
• John S. Caughman IV:
  The Terwilliger algebras of bipartite P- and Q-polynomial schemes. 65-95
  Electronic Edition (link) BibTeX
• C. T. Cheng, Lenore Cowen:
  On the local distinguishing numbers of cycles. 97-108
  Electronic Edition (link) BibTeX
• Thomas Dinski, Xuding Zhu:
  A bound for the game chromatic number of graphs. 109-115
  Electronic Edition (link) BibTeX
• Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada:
  Optimal ternary formally self-dual codes. 117-135
  Electronic Edition (link) BibTeX
• Tung-Shan Fu:
  Erdös-Ko-Rado-type results over J_q(n, d), H_q(n, d) and their designs. 137-151
  Electronic Edition (link) BibTeX
• Albert Gräf:
  Distance graphs and the T-coloring problem. 153-166
  Electronic Edition (link) BibTeX
• Zhiquan Hu:
  A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity. 167-175
  Electronic Edition (link) BibTeX
• Stanislav Jendrol:
  Triangles with restricted degrees of their boundary vertices in plane triangulations. 177-196
  Electronic Edition (link) BibTeX
• Arnold Knopfmacher:
  On the degrees of irreducible factors of polynomials over a finite field. 197-206
  Electronic Edition (link) BibTeX
• Wojciech Kordecki, Tomasz Luczak:
  On the connectivity of random subsets of projective spaces. 207-217
  Electronic Edition (link) BibTeX
• Sheng-Chyang Liaw, Gerard J. Chang:
  Rabin numbers of Butterfly networks. 219-227
  Electronic Edition (link) BibTeX
• Václav Linek, Zhike Jiang:
  Hooked k-extended Skolem sequences. 229-238
  Electronic Edition (link) BibTeX
• B. S. Panda:
  The forbidden subgraph characterization of directed vertex graphs. 239-256
  Electronic Edition (link) BibTeX
• Mario-Osvin Pavcevic, Edward Spence:
  Some new symmetric designs with lambda = 10 having an automorphism of order 5. 257-266
  Electronic Edition (link) BibTeX
• J. A. Rodríguez, José Luis Andres Yebra:
  Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. 267-275
  Electronic Edition (link) BibTeX
• Yoshimi Kashiwagi, Isao Kikumasa:
  Indecomposability of cyclic codes. 277-280
  Electronic Edition (link) BibTeX
• Zhenqi Yang:
  On F-Hamiltonian graphs. 281-286
  Electronic Edition (link) BibTeX
• Zhizheng Zhang:
  A binomial identity related to Calkin's. 287-289
  Electronic Edition (link) BibTeX
• Zhizheng Zhang:
  A kind of binomial identity. 291-298
  Electronic Edition (link) BibTeX